Base | Representation |
---|---|
bin | 1011000001101010110110… |
… | …1001011100010000100010 |
3 | 1120220222101101112112101220 |
4 | 2300122231221130100202 |
5 | 3042112020111000310 |
6 | 41441212221235510 |
7 | 2360610643333332 |
oct | 260325551342042 |
9 | 46828341475356 |
10 | 12123311031330 |
11 | 3954516028854 |
12 | 14396b4402b96 |
13 | 69c2b984c395 |
14 | 2dcab29730c2 |
15 | 16054d907670 |
hex | b06ada5c422 |
12123311031330 has 16 divisors (see below), whose sum is σ = 29095946475264. Its totient is φ = 3232882941680.
The previous prime is 12123311031317. The next prime is 12123311031371. The reversal of 12123311031330 is 3313011332121.
It is a self number, because there is not a number n which added to its sum of digits gives 12123311031330.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 202055183826 + ... + 202055183885.
It is an arithmetic number, because the mean of its divisors is an integer number (1818496654704).
Almost surely, 212123311031330 is an apocalyptic number.
12123311031330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12123311031330 is an abundant number, since it is smaller than the sum of its proper divisors (16972635443934).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12123311031330 is a wasteful number, since it uses less digits than its factorization.
12123311031330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 404110367721.
The product of its (nonzero) digits is 972, while the sum is 24.
Adding to 12123311031330 its reverse (3313011332121), we get a palindrome (15436322363451).
The spelling of 12123311031330 in words is "twelve trillion, one hundred twenty-three billion, three hundred eleven million, thirty-one thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •