Base | Representation |
---|---|
bin | 100001110000101110001… |
… | …1010011101011111100110 |
3 | 121102120221121020000000100 |
4 | 1003201130122131133212 |
5 | 1102010423432320402 |
6 | 13511350042324530 |
7 | 656144243520060 |
oct | 103413432353746 |
9 | 17376847200010 |
10 | 4640115120102 |
11 | 1529953021690 |
12 | 62b3511b9746 |
13 | 27873a6141a7 |
14 | 12082319a730 |
15 | 80a7799e71c |
hex | 4385c69d7e6 |
4640115120102 has 96 divisors (see below), whose sum is σ = 12534997722624. Its totient is φ = 1205161171200.
The previous prime is 4640115120037. The next prime is 4640115120103. The reversal of 4640115120102 is 2010215110464.
4640115120102 is a `hidden beast` number, since 4 + 6 + 40 + 1 + 1 + 512 + 0 + 102 = 666.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4640115120103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 29883727 + ... + 30038597.
It is an arithmetic number, because the mean of its divisors is an integer number (130572892944).
Almost surely, 24640115120102 is an apocalyptic number.
4640115120102 is a gapful number since it is divisible by the number (42) formed by its first and last digit.
4640115120102 is an abundant number, since it is smaller than the sum of its proper divisors (7894882602522).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4640115120102 is a wasteful number, since it uses less digits than its factorization.
4640115120102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 176514 (or 176511 counting only the distinct ones).
The product of its (nonzero) digits is 1920, while the sum is 27.
The spelling of 4640115120102 in words is "four trillion, six hundred forty billion, one hundred fifteen million, one hundred twenty thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •