Base | Representation |
---|---|
bin | 1010111010100111011001… |
… | …0010111100000100001010 |
3 | 1120111101120121102222101001 |
4 | 2232221312102330010022 |
5 | 3033120322031114010 |
6 | 41305411015445214 |
7 | 2346060542534554 |
oct | 256516622740412 |
9 | 46441517388331 |
10 | 12002123301130 |
11 | 3908087788426 |
12 | 141a11298680a |
13 | 690a455785a1 |
14 | 2d6c979b24d4 |
15 | 15c30953bc3a |
hex | aea764bc10a |
12002123301130 has 8 divisors (see below), whose sum is σ = 21603821942052. Its totient is φ = 4800849320448.
The previous prime is 12002123301041. The next prime is 12002123301137. The reversal of 12002123301130 is 3110332120021.
It can be written as a sum of positive squares in 2 ways, for example, as 11423703730609 + 578419570521 = 3379897^2 + 760539^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 12002123301098 and 12002123301107.
It is not an unprimeable number, because it can be changed into a prime (12002123301137) 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, 600106165047 + ... + 600106165066.
Almost surely, 212002123301130 is an apocalyptic number.
12002123301130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12002123301130 is a deficient number, since it is larger than the sum of its proper divisors (9601698640922).
12002123301130 is a wasteful number, since it uses less digits than its factorization.
12002123301130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1200212330120.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 12002123301130 its reverse (3110332120021), we get a palindrome (15112455421151).
The spelling of 12002123301130 in words is "twelve trillion, two billion, one hundred twenty-three million, three hundred one thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •