Base | Representation |
---|---|
bin | 111001000001011101… |
… | …1111110010001000000 |
3 | 102201002011021102000002 |
4 | 1302002323332101000 |
5 | 4001242144001104 |
6 | 132131101415132 |
7 | 11563366333112 |
oct | 1620273762100 |
9 | 381064242002 |
10 | 122455843904 |
11 | 47a2a149a89 |
12 | 1b89626a4a8 |
13 | b716c26344 |
14 | 5cd95813b2 |
15 | 32ba8ad01e |
hex | 1c82efe440 |
122455843904 has 84 divisors (see below), whose sum is σ = 257951677644. Its totient is φ = 57668226048.
The previous prime is 122455843891. The next prime is 122455843969. The reversal of 122455843904 is 409348554221.
It can be written as a sum of positive squares in 2 ways, for example, as 114276450304 + 8179393600 = 338048^2 + 90440^2 .
It is a super-2 number, since 2×1224558439042 (a number of 23 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3981674 + ... + 4012310.
Almost surely, 2122455843904 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 122455843904, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (128975838822).
122455843904 is an abundant number, since it is smaller than the sum of its proper divisors (135495833740).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122455843904 is a wasteful number, since it uses less digits than its factorization.
122455843904 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30860 (or 30831 counting only the distinct ones).
The product of its (nonzero) digits is 1382400, while the sum is 47.
The spelling of 122455843904 in words is "one hundred twenty-two billion, four hundred fifty-five million, eight hundred forty-three thousand, nine hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •