Base | Representation |
---|---|
bin | 111000110110111001… |
… | …1101100100100010100 |
3 | 102200011110020101112010 |
4 | 1301231303230210110 |
5 | 4000030421241344 |
6 | 132031555424220 |
7 | 11551533242121 |
oct | 1615563544424 |
9 | 380143211463 |
10 | 122101352724 |
11 | 4786803756a |
12 | 1b7b75b5070 |
13 | b68b659b50 |
14 | 5ca4465748 |
15 | 32996d88b9 |
hex | 1c6dcec914 |
122101352724 has 48 divisors (see below), whose sum is σ = 312607838592. Its totient is φ = 36860783232.
The previous prime is 122101352713. The next prime is 122101352731. The reversal of 122101352724 is 427253101221.
It is a junction number, because it is equal to n+sod(n) for n = 122101352691 and 122101352700.
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 15 ways as a sum of consecutive naturals, for example, 7375704 + ... + 7392239.
It is an arithmetic number, because the mean of its divisors is an integer number (6512663304).
Almost surely, 2122101352724 is an apocalyptic number.
It is an amenable number.
122101352724 is an abundant number, since it is smaller than the sum of its proper divisors (190506485868).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122101352724 is a wasteful number, since it uses less digits than its factorization.
122101352724 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14768016 (or 14768014 counting only the distinct ones).
The product of its (nonzero) digits is 6720, while the sum is 30.
Adding to 122101352724 its reverse (427253101221), we get a palindrome (549354453945).
It can be divided in two parts, 122101 and 352724, that added together give a triangular number (474825 = T974).
The spelling of 122101352724 in words is "one hundred twenty-two billion, one hundred one million, three hundred fifty-two thousand, seven hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •