Base | Representation |
---|---|
bin | 1011001100001001001000… |
… | …0011000110010001000100 |
3 | 1121120011210201021112101111 |
4 | 2303002102003012101010 |
5 | 3103034012033341010 |
6 | 42100010123134404 |
7 | 2406610446531655 |
oct | 263022203062104 |
9 | 47504721245344 |
10 | 12303236621380 |
11 | 3a13856367701 |
12 | 1468549074404 |
13 | 6b3261c3ca73 |
14 | 3076a091d52c |
15 | 16507e81358a |
hex | b30920c6444 |
12303236621380 has 12 divisors (see below), whose sum is σ = 25836796904940. Its totient is φ = 4921294648544.
The previous prime is 12303236621353. The next prime is 12303236621383. The reversal of 12303236621380 is 8312663230321.
It can be written as a sum of positive squares in 2 ways, for example, as 9210302383104 + 3092934238276 = 3034848^2 + 1758674^2 .
It is not an unprimeable number, because it can be changed into a prime (12303236621383) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 307580915515 + ... + 307580915554.
It is an arithmetic number, because the mean of its divisors is an integer number (2153066408745).
Almost surely, 212303236621380 is an apocalyptic number.
12303236621380 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12303236621380 is an abundant number, since it is smaller than the sum of its proper divisors (13533560283560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12303236621380 is a wasteful number, since it uses less digits than its factorization.
12303236621380 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 615161831078 (or 615161831076 counting only the distinct ones).
The product of its (nonzero) digits is 186624, while the sum is 40.
The spelling of 12303236621380 in words is "twelve trillion, three hundred three billion, two hundred thirty-six million, six hundred twenty-one thousand, three hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •