Base | Representation |
---|---|
bin | 10010111000010001… |
… | …00010000100010000 |
3 | 222011101001122110000 |
4 | 21130020202010100 |
5 | 131224213101102 |
6 | 4353430410000 |
7 | 506112550221 |
oct | 113410420420 |
9 | 28141048400 |
10 | 10135675152 |
11 | 4331362839 |
12 | 1b6a500900 |
13 | c56b42125 |
14 | 6c219d248 |
15 | 3e4c5d01c |
hex | 25c222110 |
10135675152 has 100 divisors (see below), whose sum is σ = 29610153936. Its totient is φ = 3346937280.
The previous prime is 10135675133. The next prime is 10135675157. The reversal of 10135675152 is 25157653101.
It is a happy number.
10135675152 is a `hidden beast` number, since 1 + 0 + 135 + 6 + 7 + 515 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (10135675157) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 102127 + ... + 175217.
Almost surely, 210135675152 is an apocalyptic number.
10135675152 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 10135675152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14805076968).
10135675152 is an abundant number, since it is smaller than the sum of its proper divisors (19474478784).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10135675152 is a wasteful number, since it uses less digits than its factorization.
10135675152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 73218 (or 73203 counting only the distinct ones).
The product of its (nonzero) digits is 31500, while the sum is 36.
The spelling of 10135675152 in words is "ten billion, one hundred thirty-five million, six hundred seventy-five thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •