Base | Representation |
---|---|
bin | 100010101010100100010… |
… | …0111010101011001000011 |
3 | 121212110120211121102202220 |
4 | 1011111020213111121003 |
5 | 1111024330233031201 |
6 | 14044412312342123 |
7 | 1001132466221154 |
oct | 105251047253103 |
9 | 17773524542686 |
10 | 4764337002051 |
11 | 15775a9039140 |
12 | 64b43a9a4943 |
13 | 287376399153 |
14 | 1268490d392b |
15 | 83de8408036 |
hex | 455489d5643 |
4764337002051 has 8 divisors (see below), whose sum is σ = 6929944730304. Its totient is φ = 2887476970920.
The previous prime is 4764337002013. The next prime is 4764337002067. The reversal of 4764337002051 is 1502007334674.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 4764337002051 - 29 = 4764337001539 is a prime.
It is a super-2 number, since 2×47643370020512 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 4764337001994 and 4764337002012.
It is not an unprimeable number, because it can be changed into a prime (4764337002071) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 72186924241 + ... + 72186924306.
It is an arithmetic number, because the mean of its divisors is an integer number (866243091288).
Almost surely, 24764337002051 is an apocalyptic number.
4764337002051 is a deficient number, since it is larger than the sum of its proper divisors (2165607728253).
4764337002051 is a wasteful number, since it uses less digits than its factorization.
4764337002051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 144373848561.
The product of its (nonzero) digits is 423360, while the sum is 42.
The spelling of 4764337002051 in words is "four trillion, seven hundred sixty-four billion, three hundred thirty-seven million, two thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •