Base | Representation |
---|---|
bin | 1010111011001100010010… |
… | …1001000110011000111011 |
3 | 1120112100010212020221112122 |
4 | 2232303010221012120323 |
5 | 3033301113040334102 |
6 | 41314125504431455 |
7 | 2346561146343032 |
oct | 256630451063073 |
9 | 46470125227478 |
10 | 12012027668027 |
11 | 39112aa513912 |
12 | 142001791858b |
13 | 6919634c0b0a |
14 | 2d755715d719 |
15 | 15c6d8d090a2 |
hex | aecc4a4663b |
12012027668027 has 8 divisors (see below), whose sum is σ = 12038889623280. Its totient is φ = 11985178508640.
The previous prime is 12012027667999. The next prime is 12012027668057. The reversal of 12012027668027 is 72086672021021.
12012027668027 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12012027668027 - 212 = 12012027663931 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12012027668057) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1318148 + ... + 5075585.
It is an arithmetic number, because the mean of its divisors is an integer number (1504861202910).
Almost surely, 212012027668027 is an apocalyptic number.
12012027668027 is a deficient number, since it is larger than the sum of its proper divisors (26861955253).
12012027668027 is an equidigital number, since it uses as much as digits as its factorization.
12012027668027 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6397933.
The product of its (nonzero) digits is 225792, while the sum is 44.
Adding to 12012027668027 its reverse (72086672021021), we get a palindrome (84098699689048).
The spelling of 12012027668027 in words is "twelve trillion, twelve billion, twenty-seven million, six hundred sixty-eight thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •