Base | Representation |
---|---|
bin | 10011001000010111… |
… | …00000000010100100 |
3 | 222111210002010221200 |
4 | 21210023200002210 |
5 | 132013242433022 |
6 | 4415052042500 |
7 | 512342156160 |
oct | 114413400244 |
9 | 28453063850 |
10 | 10270671012 |
11 | 43a0587168 |
12 | 1ba7763430 |
13 | c78ab9834 |
14 | 6d609dca0 |
15 | 401a26bac |
hex | 2642e00a4 |
10270671012 has 144 divisors (see below), whose sum is σ = 30064175232. Its totient is φ = 2895782400.
The previous prime is 10270670939. The next prime is 10270671017. The reversal of 10270671012 is 21017607201.
It is not an unprimeable number, because it can be changed into a prime (10270671017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 11631123 + ... + 11632005.
Almost surely, 210270671012 is an apocalyptic number.
10270671012 is a gapful number since it is divisible by the number (12) 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 10270671012, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15032087616).
10270671012 is an abundant number, since it is smaller than the sum of its proper divisors (19793504220).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10270671012 is a wasteful number, since it uses less digits than its factorization.
10270671012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1458 (or 1453 counting only the distinct ones).
The product of its (nonzero) digits is 1176, while the sum is 27.
The spelling of 10270671012 in words is "ten billion, two hundred seventy million, six hundred seventy-one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •