Base | Representation |
---|---|
bin | 111000110110111101… |
… | …0011001111001000000 |
3 | 102200011120112201202001 |
4 | 1301231322121321000 |
5 | 4000031344024412 |
6 | 132032101233344 |
7 | 11551554215014 |
oct | 1615572317100 |
9 | 380146481661 |
10 | 122103111232 |
11 | 47869028783 |
12 | 1b7b8102854 |
13 | b68bb2439b |
14 | 5ca47a2544 |
15 | 3299934957 |
hex | 1c6de99e40 |
122103111232 has 112 divisors (see below), whose sum is σ = 248965516800. Its totient is φ = 59399442432.
The previous prime is 122103111227. The next prime is 122103111287. The reversal of 122103111232 is 232111301221.
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 15 ways as a sum of consecutive naturals, for example, 142476948 + ... + 142477804.
It is an arithmetic number, because the mean of its divisors is an integer number (2222906400).
Almost surely, 2122103111232 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 122103111232, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (124482758400).
122103111232 is an abundant number, since it is smaller than the sum of its proper divisors (126862405568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122103111232 is a wasteful number, since it uses less digits than its factorization.
122103111232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1308 (or 1298 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 122103111232 its reverse (232111301221), we get a palindrome (354214412453).
The spelling of 122103111232 in words is "one hundred twenty-two billion, one hundred three million, one hundred eleven thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •