Base | Representation |
---|---|
bin | 11011101111011110101011… |
… | …111101100100100110010100 |
3 | 121000000001012010221112221012 |
4 | 123233132223331210212110 |
5 | 111443003010340201400 |
6 | 1111254344015111352 |
7 | 34461635030031131 |
oct | 3357365375444624 |
9 | 530001163845835 |
10 | 122010021022100 |
11 | 35970183088242 |
12 | 11826439212558 |
13 | 5310659b2bc03 |
14 | 221b460795588 |
15 | e18b62294d35 |
hex | 6ef7abf64994 |
122010021022100 has 72 divisors (see below), whose sum is σ = 278855118255168. Its totient is φ = 46245813644800.
The previous prime is 122010021022039. The next prime is 122010021022139. The reversal of 122010021022100 is 1220120010221.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 247640981 + ... + 248133180.
It is an arithmetic number, because the mean of its divisors is an integer number (3872987753544).
Almost surely, 2122010021022100 is an apocalyptic number.
122010021022100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
122010021022100 is an abundant number, since it is smaller than the sum of its proper divisors (156845097233068).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122010021022100 is a wasteful number, since it uses less digits than its factorization.
122010021022100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 495774305 (or 495774298 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 122010021022100 its reverse (1220120010221), we get a palindrome (123230141032321).
The spelling of 122010021022100 in words is "one hundred twenty-two trillion, ten billion, twenty-one million, twenty-two thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •