Base | Representation |
---|---|
bin | 111001001111100111… |
… | …0001101001100000000 |
3 | 102202022020012121220211 |
4 | 1302133032031030000 |
5 | 4003230134320124 |
6 | 132250132443504 |
7 | 11611221015562 |
oct | 1623716151400 |
9 | 382266177824 |
10 | 122930385664 |
11 | 48152aa8259 |
12 | 1b9a9179594 |
13 | b791336798 |
14 | 5d425cb332 |
15 | 32e7397e94 |
hex | 1c9f38d300 |
122930385664 has 72 divisors (see below), whose sum is σ = 258004267920. Its totient is φ = 58372608000.
The previous prime is 122930385637. The next prime is 122930385673. The reversal of 122930385664 is 466583039221.
It is a super-2 number, since 2×1229303856642 (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 7 ways as a sum of consecutive naturals, for example, 317139 + ... + 588589.
It is an arithmetic number, because the mean of its divisors is an integer number (3583392610).
Almost surely, 2122930385664 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 122930385664, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (129002133960).
122930385664 is an abundant number, since it is smaller than the sum of its proper divisors (135073882256).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122930385664 is an equidigital number, since it uses as much as digits as its factorization.
122930385664 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 271557 (or 271543 counting only the distinct ones).
The product of its (nonzero) digits is 1866240, while the sum is 49.
The spelling of 122930385664 in words is "one hundred twenty-two billion, nine hundred thirty million, three hundred eighty-five thousand, six hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •