Base | Representation |
---|---|
bin | 10010110100010001… |
… | …01100010101000000 |
3 | 222002001000001002000 |
4 | 21122020230111000 |
5 | 131142123202002 |
6 | 4350232224000 |
7 | 505224652353 |
oct | 113210542500 |
9 | 28061001060 |
10 | 10102162752 |
11 | 4314453440 |
12 | 1b5b23b000 |
13 | c4cc0a4c6 |
14 | 6bb95829a |
15 | 3e1d3d61c |
hex | 25a22c540 |
10102162752 has 224 divisors, whose sum is σ = 32707722240. Its totient is φ = 3032040960.
The previous prime is 10102162669. The next prime is 10102162771. The reversal of 10102162752 is 25726120101.
10102162752 is a `hidden beast` number, since 1 + 0 + 10 + 21 + 627 + 5 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2031373 + ... + 2036339.
Almost surely, 210102162752 is an apocalyptic number.
10102162752 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 10102162752, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16353861120).
10102162752 is an abundant number, since it is smaller than the sum of its proper divisors (22605559488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10102162752 is a wasteful number, since it uses less digits than its factorization.
10102162752 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5106 (or 5090 counting only the distinct ones).
The product of its (nonzero) digits is 1680, while the sum is 27.
Adding to 10102162752 its reverse (25726120101), we get a palindrome (35828282853).
The spelling of 10102162752 in words is "ten billion, one hundred two million, one hundred sixty-two thousand, seven hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •