Base | Representation |
---|---|
bin | 100010100100011000111… |
… | …1001111101011111000100 |
3 | 121211012100022111010220000 |
4 | 1011020301321331133010 |
5 | 1110320143200411022 |
6 | 14034340102241300 |
7 | 1000152654040266 |
oct | 105106171753704 |
9 | 17735308433800 |
10 | 4751071107012 |
11 | 1571a1086391a |
12 | 648958126230 |
13 | 286040baac09 |
14 | 125d4b311b36 |
15 | 838bd9826ac |
hex | 45231e7d7c4 |
4751071107012 has 60 divisors (see below), whose sum is σ = 12442067026620. Its totient is φ = 1580907020544.
The previous prime is 4751071107001. The next prime is 4751071107049. The reversal of 4751071107012 is 2107011701574.
4751071107012 is a `hidden beast` number, since 4 + 7 + 510 + 71 + 1 + 0 + 70 + 1 + 2 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 498303280836 + 4252767826176 = 705906^2 + 2062224^2 .
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 12701233 + ... + 13069944.
It is an arithmetic number, because the mean of its divisors is an integer number (207367783777).
Almost surely, 24751071107012 is an apocalyptic number.
It is an amenable number.
4751071107012 is an abundant number, since it is smaller than the sum of its proper divisors (7690995919608).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4751071107012 is a wasteful number, since it uses less digits than its factorization.
4751071107012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 25771762 (or 25771751 counting only the distinct ones).
The product of its (nonzero) digits is 13720, while the sum is 36.
Adding to 4751071107012 its reverse (2107011701574), we get a palindrome (6858082808586).
The spelling of 4751071107012 in words is "four trillion, seven hundred fifty-one billion, seventy-one million, one hundred seven thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •