Base | Representation |
---|---|
bin | 1011001100000000111000… |
… | …0100001110000110110001 |
3 | 1121112222002101200112012212 |
4 | 2303000032010032012301 |
5 | 3103014443203314441 |
6 | 42055002303101505 |
7 | 2406501541361630 |
oct | 263001604160661 |
9 | 47488071615185 |
10 | 12301022323121 |
11 | 3a1291a461644 |
12 | 146802b5a1895 |
13 | 6b2c9b2732cc |
14 | 3075307dd517 |
15 | 164ea021eeeb |
hex | b300e10e1b1 |
12301022323121 has 16 divisors (see below), whose sum is σ = 14681401353984. Its totient is φ = 10077157024704.
The previous prime is 12301022323081. The next prime is 12301022323147. The reversal of 12301022323121 is 12132322010321.
It is a de Polignac number, because none of the positive numbers 2k-12301022323121 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (12301022323721) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 30683570 + ... + 31081883.
It is an arithmetic number, because the mean of its divisors is an integer number (917587584624).
Almost surely, 212301022323121 is an apocalyptic number.
It is an amenable number.
12301022323121 is a deficient number, since it is larger than the sum of its proper divisors (2380379030863).
12301022323121 is a wasteful number, since it uses less digits than its factorization.
12301022323121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61766720.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 12301022323121 its reverse (12132322010321), we get a palindrome (24433344333442).
The spelling of 12301022323121 in words is "twelve trillion, three hundred one billion, twenty-two million, three hundred twenty-three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •