Base | Representation |
---|---|
bin | 10111001100010011000101… |
… | …110000100111010111100010 |
3 | 111101011010100101202110022012 |
4 | 113030103011300213113202 |
5 | 101332132403001413442 |
6 | 1000534125012112522 |
7 | 30325162033626440 |
oct | 2714230560472742 |
9 | 441133311673265 |
10 | 102000201201122 |
11 | 2a556051490384 |
12 | b5343a5005742 |
13 | 44bb768295223 |
14 | 1b28b9c2b7b90 |
15 | bbd3d5292582 |
hex | 5cc4c5c275e2 |
102000201201122 has 16 divisors (see below), whose sum is σ = 174857639628672. Its totient is φ = 43714333979520.
The previous prime is 102000201200999. The next prime is 102000201201187. The reversal of 102000201201122 is 221102102000201.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a junction number, because it is equal to n+sod(n) for n = 102000201201097 and 102000201201106.
It is an unprimeable number.
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, 18782258 + ... + 23596050.
It is an arithmetic number, because the mean of its divisors is an integer number (10928602476792).
Almost surely, 2102000201201122 is an apocalyptic number.
102000201201122 is a deficient number, since it is larger than the sum of its proper divisors (72857438427550).
102000201201122 is a wasteful number, since it uses less digits than its factorization.
102000201201122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6327313.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 102000201201122 its reverse (221102102000201), we get a palindrome (323102303201323).
The spelling of 102000201201122 in words is "one hundred two trillion, two hundred one million, two hundred one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •