Base | Representation |
---|---|
bin | 11101110001101101011… |
… | …10010010111000110101 |
3 | 10121210212000101110222000 |
4 | 32320312232102320311 |
5 | 113230322300301401 |
6 | 2102003123125513 |
7 | 133626606150633 |
oct | 16706656227065 |
9 | 3553760343860 |
10 | 1023120322101 |
11 | 3649a2827109 |
12 | 146354b13899 |
13 | 756312653c7 |
14 | 3773acd6353 |
15 | 1b9313e2186 |
hex | ee36b92e35 |
1023120322101 has 8 divisors (see below), whose sum is σ = 1515733810560. Its totient is φ = 682080214716.
The previous prime is 1023120322099. The next prime is 1023120322121. The reversal of 1023120322101 is 1012230213201.
1023120322101 is a `hidden beast` number, since 10 + 231 + 2 + 0 + 322 + 101 = 666.
It is not a de Polignac number, because 1023120322101 - 21 = 1023120322099 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1023120322121) 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, 18946672605 + ... + 18946672658.
It is an arithmetic number, because the mean of its divisors is an integer number (189466726320).
Almost surely, 21023120322101 is an apocalyptic number.
It is an amenable number.
1023120322101 is a deficient number, since it is larger than the sum of its proper divisors (492613488459).
1023120322101 is an equidigital number, since it uses as much as digits as its factorization.
1023120322101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37893345272 (or 37893345266 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 1023120322101 its reverse (1012230213201), we get a palindrome (2035350535302).
The spelling of 1023120322101 in words is "one trillion, twenty-three billion, one hundred twenty million, three hundred twenty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •