Base | Representation |
---|---|
bin | 100010101000111000000… |
… | …1011110111000000101000 |
3 | 121212010012210002102001220 |
4 | 1011101300023313000220 |
5 | 1110444411203433224 |
6 | 14043012121542040 |
7 | 1000643505436212 |
oct | 105216013670050 |
9 | 17763183072056 |
10 | 4760705921064 |
11 | 1576005421265 |
12 | 64a7a6944920 |
13 | 286c18026012 |
14 | 1265c2b735b2 |
15 | 83c84757279 |
hex | 454702f7028 |
4760705921064 has 64 divisors (see below), whose sum is σ = 12287814458880. Its totient is φ = 1535446368000.
The previous prime is 4760705921003. The next prime is 4760705921117. The reversal of 4760705921064 is 4601295070674.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 4760705920998 and 4760705921016.
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 15 ways as a sum of consecutive naturals, for example, 3781194 + ... + 4880454.
It is an arithmetic number, because the mean of its divisors is an integer number (191997100920).
Almost surely, 24760705921064 is an apocalyptic number.
It is an amenable number.
4760705921064 is an abundant number, since it is smaller than the sum of its proper divisors (7527108537816).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4760705921064 is a wasteful number, since it uses less digits than its factorization.
4760705921064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1105122 (or 1105118 counting only the distinct ones).
The product of its (nonzero) digits is 2540160, while the sum is 51.
The spelling of 4760705921064 in words is "four trillion, seven hundred sixty billion, seven hundred five million, nine hundred twenty-one thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •