Base | Representation |
---|---|
bin | 100010100100010111010… |
… | …1001111000101010111000 |
3 | 121211012012111211221021210 |
4 | 1011020232221320222320 |
5 | 1110320040214430321 |
6 | 14034330433203120 |
7 | 1000151422311063 |
oct | 105105651705270 |
9 | 17735174757253 |
10 | 4751016561336 |
11 | 1571992a98951 |
12 | 648941a004a0 |
13 | 2860327c0776 |
14 | 125d43d938da |
15 | 838b8caab76 |
hex | 4522ea78ab8 |
4751016561336 has 128 divisors (see below), whose sum is σ = 12278004157440. Its totient is φ = 1531169203200.
The previous prime is 4751016561329. The next prime is 4751016561359. The reversal of 4751016561336 is 6331656101574.
It is a hoax number, since the sum of its digits (48) coincides with the sum of the digits of its distinct prime factors.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 205990141 + ... + 206013203.
It is an arithmetic number, because the mean of its divisors is an integer number (95921907480).
Almost surely, 24751016561336 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 4751016561336, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6139002078720).
4751016561336 is an abundant number, since it is smaller than the sum of its proper divisors (7526987596104).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4751016561336 is a wasteful number, since it uses less digits than its factorization.
4751016561336 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 25477 (or 25473 counting only the distinct ones).
The product of its (nonzero) digits is 1360800, while the sum is 48.
The spelling of 4751016561336 in words is "four trillion, seven hundred fifty-one billion, sixteen million, five hundred sixty-one thousand, three hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •