Base | Representation |
---|---|
bin | 1010111010011111111100… |
… | …0100011110011111111111 |
3 | 1120111012102012120020022022 |
4 | 2232213333010132133333 |
5 | 3033102222443140221 |
6 | 41304440322510355 |
7 | 2345660143456145 |
oct | 256477704363777 |
9 | 46435365506268 |
10 | 12000123021311 |
11 | 390725066a607 |
12 | 1419854b053bb |
13 | 6907b7033a69 |
14 | 2d6b48083595 |
15 | 15c23db214ab |
hex | ae9ff11e7ff |
12000123021311 has 16 divisors (see below), whose sum is σ = 12193511990400. Its totient is φ = 11807822577408.
The previous prime is 12000123021259. The next prime is 12000123021319. The reversal of 12000123021311 is 11312032100021.
It is a cyclic number.
It is not a de Polignac number, because 12000123021311 - 210 = 12000123020287 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 12000123021311.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12000123021319) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 36498425 + ... + 36825741.
It is an arithmetic number, because the mean of its divisors is an integer number (762094499400).
Almost surely, 212000123021311 is an apocalyptic number.
12000123021311 is a deficient number, since it is larger than the sum of its proper divisors (193388969089).
12000123021311 is a wasteful number, since it uses less digits than its factorization.
12000123021311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 328978.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 12000123021311 its reverse (11312032100021), we get a palindrome (23312155121332).
The spelling of 12000123021311 in words is "twelve trillion, one hundred twenty-three million, twenty-one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •