Base | Representation |
---|---|
bin | 10011100000010001… |
… | …10000101011001100 |
3 | 1000000202120002210120 |
4 | 21300020300223030 |
5 | 132421121414213 |
6 | 4451015504540 |
7 | 520326256050 |
oct | 116010605314 |
9 | 30022502716 |
10 | 10471279308 |
11 | 4493845146 |
12 | 2042988150 |
13 | cab527979 |
14 | 71499dc60 |
15 | 414451423 |
hex | 270230acc |
10471279308 has 24 divisors (see below), whose sum is σ = 27923411712. Its totient is φ = 2991794064.
The previous prime is 10471279303. The next prime is 10471279361. The reversal of 10471279308 is 80397217401.
It is a super-2 number, since 2×104712793082 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a self number, because there is not a number n which added to its sum of digits gives 10471279308.
It is not an unprimeable number, because it can be changed into a prime (10471279303) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 62328960 + ... + 62329127.
It is an arithmetic number, because the mean of its divisors is an integer number (1163475488).
Almost surely, 210471279308 is an apocalyptic number.
It is an amenable number.
10471279308 is an abundant number, since it is smaller than the sum of its proper divisors (17452132404).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10471279308 is a wasteful number, since it uses less digits than its factorization.
10471279308 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 124658101 (or 124658099 counting only the distinct ones).
The product of its (nonzero) digits is 84672, while the sum is 42.
The spelling of 10471279308 in words is "ten billion, four hundred seventy-one million, two hundred seventy-nine thousand, three hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •