Base | Representation |
---|---|
bin | 111000110111110001… |
… | …0001000100001111110 |
3 | 102200020110201012222100 |
4 | 1301233202020201332 |
5 | 4000110324144402 |
6 | 132034512125530 |
7 | 11552334306423 |
oct | 1615742104176 |
9 | 380213635870 |
10 | 122130303102 |
11 | 478824103a5 |
12 | 1b8052368a6 |
13 | b694655152 |
14 | 5ca823dd4a |
15 | 329c00671c |
hex | 1c6f88887e |
122130303102 has 12 divisors (see below), whose sum is σ = 264615656760. Its totient is φ = 40710101028.
The previous prime is 122130303077. The next prime is 122130303149. The reversal of 122130303102 is 201303031221.
It is a Harshad number since it is a multiple of its sum of digits (18), and also a Moran number because the ratio is a prime number: 6785016839 = 122130303102 / (1 + 2 + 2 + 1 + 3 + 0 + 3 + 0 + 3 + 1 + 0 + 2).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 3392508402 + ... + 3392508437.
It is an arithmetic number, because the mean of its divisors is an integer number (22051304730).
Almost surely, 2122130303102 is an apocalyptic number.
122130303102 is an abundant number, since it is smaller than the sum of its proper divisors (142485353658).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122130303102 is a wasteful number, since it uses less digits than its factorization.
122130303102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6785016847 (or 6785016844 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 122130303102 its reverse (201303031221), we get a palindrome (323433334323).
The spelling of 122130303102 in words is "one hundred twenty-two billion, one hundred thirty million, three hundred three thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •