Base | Representation |
---|---|
bin | 10011100000010001… |
… | …01111110000000000 |
3 | 1000000202112220121021 |
4 | 21300020233300000 |
5 | 132421121304040 |
6 | 4451015435224 |
7 | 520326242026 |
oct | 116010576000 |
9 | 30022486537 |
10 | 10471275520 |
11 | 4493842312 |
12 | 2042985b14 |
13 | cab526024 |
14 | 71499c716 |
15 | 41445024a |
hex | 27022fc00 |
10471275520 has 88 divisors (see below), whose sum is σ = 25159333104. Its totient is φ = 4181753856.
The previous prime is 10471275499. The next prime is 10471275541. The reversal of 10471275520 is 2557217401.
It is an interprime number because it is at equal distance from previous prime (10471275499) and next prime (10471275541).
It is a super-2 number, since 2×104712755202 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4233004 + ... + 4235476.
Almost surely, 210471275520 is an apocalyptic number.
10471275520 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10471275520, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12579666552).
10471275520 is an abundant number, since it is smaller than the sum of its proper divisors (14688057584).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10471275520 is an equidigital number, since it uses as much as digits as its factorization.
10471275520 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3325 (or 3307 counting only the distinct ones).
The product of its (nonzero) digits is 19600, while the sum is 34.
The spelling of 10471275520 in words is "ten billion, four hundred seventy-one million, two hundred seventy-five thousand, five hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •