Base | Representation |
---|---|
bin | 1000001001101101101… |
… | …1011010111011001010 |
3 | 111101111002101220211000 |
4 | 2002123123122323022 |
5 | 4243303413010442 |
6 | 144200404515430 |
7 | 13055325354606 |
oct | 2023333327312 |
9 | 441432356730 |
10 | 140046610122 |
11 | 5443672a001 |
12 | 231853abb76 |
13 | 1028b431453 |
14 | 6ac78c2506 |
15 | 3999d7bd4c |
hex | 209b6daeca |
140046610122 has 128 divisors (see below), whose sum is σ = 322237440000. Its totient is φ = 45063216000.
The previous prime is 140046610043. The next prime is 140046610141. The reversal of 140046610122 is 221016640041.
140046610122 is a `hidden beast` number, since 1 + 4 + 0 + 0 + 46 + 610 + 1 + 2 + 2 = 666.
It is a super-2 number, since 2×1400466101222 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 58375879 + ... + 58378277.
It is an arithmetic number, because the mean of its divisors is an integer number (2517480000).
Almost surely, 2140046610122 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 140046610122, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (161118720000).
140046610122 is an abundant number, since it is smaller than the sum of its proper divisors (182190829878).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
140046610122 is a wasteful number, since it uses less digits than its factorization.
140046610122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2793 (or 2787 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 27.
The spelling of 140046610122 in words is "one hundred forty billion, forty-six million, six hundred ten thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •