Base | Representation |
---|---|
bin | 1010111011001101010011… |
… | …1000011011010001110001 |
3 | 1120112100211211221000000221 |
4 | 2232303110320123101301 |
5 | 3033302142312334301 |
6 | 41314212520213041 |
7 | 2346600665222122 |
oct | 256632470332161 |
9 | 46470754830027 |
10 | 12012300121201 |
11 | 391142a292a26 |
12 | 142009300a181 |
13 | 6919a7a95403 |
14 | 2d7581402049 |
15 | 15c702bc5da1 |
hex | aecd4e1b471 |
12012300121201 has 8 divisors (see below), whose sum is σ = 12270678255360. Its totient is φ = 11755747981392.
The previous prime is 12012300121181. The next prime is 12012300121229. The reversal of 12012300121201 is 10212100321021.
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 12012300121201 - 241 = 9813276865649 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12012300131201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 456485290 + ... + 456511603.
It is an arithmetic number, because the mean of its divisors is an integer number (1533834781920).
Almost surely, 212012300121201 is an apocalyptic number.
It is an amenable number.
12012300121201 is a deficient number, since it is larger than the sum of its proper divisors (258378134159).
12012300121201 is an equidigital number, since it uses as much as digits as its factorization.
12012300121201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 912997175.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 12012300121201 its reverse (10212100321021), we get a palindrome (22224400442222).
The spelling of 12012300121201 in words is "twelve trillion, twelve billion, three hundred million, one hundred twenty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •