Base | Representation |
---|---|
bin | 1010111011001100010001… |
… | …0000011110010010100010 |
3 | 1120112100010102002221222110 |
4 | 2232303010100132102202 |
5 | 3033301104412243242 |
6 | 41314125114220150 |
7 | 2346561040434525 |
oct | 256630420362242 |
9 | 46470112087873 |
10 | 12012021212322 |
11 | 39112a690461a |
12 | 1420015724656 |
13 | 691962070581 |
14 | 2d755635cbbc |
15 | 15c6d848139c |
hex | aecc441e4a2 |
12012021212322 has 8 divisors (see below), whose sum is σ = 24024042424656. Its totient is φ = 4004007070772.
The previous prime is 12012021212267. The next prime is 12012021212327. The reversal of 12012021212322 is 22321212021021.
It is a sphenic number, since it is the product of 3 distinct primes.
12012021212322 is an admirable number.
It is not an unprimeable number, because it can be changed into a prime (12012021212327) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 1001001767688 + ... + 1001001767699.
It is an arithmetic number, because the mean of its divisors is an integer number (3003005303082).
Almost surely, 212012021212322 is an apocalyptic number.
12012021212322 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12012021212322 is a wasteful number, since it uses less digits than its factorization.
12012021212322 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2002003535392.
The product of its (nonzero) digits is 384, while the sum is 21.
Adding to 12012021212322 its reverse (22321212021021), we get a palindrome (34333233233343).
The spelling of 12012021212322 in words is "twelve trillion, twelve billion, twenty-one million, two hundred twelve thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •