Base | Representation |
---|---|
bin | 11011110000110011100001… |
… | …111000111110101010100110 |
3 | 121000022202022222221020220120 |
4 | 123300303201320332222212 |
5 | 112001001043221213110 |
6 | 1111404251420342410 |
7 | 34501341403313340 |
oct | 3360634170765246 |
9 | 530282288836816 |
10 | 122101120101030 |
11 | 359a5881144624 |
12 | 118400220a4a06 |
13 | 531911756b845 |
14 | 2221a23632290 |
15 | e1b1e4d74870 |
hex | 6f0ce1e3eaa6 |
122101120101030 has 64 divisors (see below), whose sum is σ = 339622914382848. Its totient is φ = 27515745371520.
The previous prime is 122101120101019. The next prime is 122101120101031. The reversal of 122101120101030 is 30101021101221.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122101120101031) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4094590057 + ... + 4094619876.
It is an arithmetic number, because the mean of its divisors is an integer number (5306608037232).
Almost surely, 2122101120101030 is an apocalyptic number.
122101120101030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
122101120101030 is an abundant number, since it is smaller than the sum of its proper divisors (217521794281818).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122101120101030 is a wasteful number, since it uses less digits than its factorization.
122101120101030 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8189210021.
The product of its (nonzero) digits is 24, while the sum is 15.
Adding to 122101120101030 its reverse (30101021101221), we get a palindrome (152202141202251).
The spelling of 122101120101030 in words is "one hundred twenty-two trillion, one hundred one billion, one hundred twenty million, one hundred one thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •