Base | Representation |
---|---|
bin | 101111100111011100… |
… | …1000100000100000000 |
3 | 100202221100102010021110 |
4 | 1133032321010010000 |
5 | 3133404330010102 |
6 | 114550410123320 |
7 | 10246660551336 |
oct | 1371671040400 |
9 | 322840363243 |
10 | 102255313152 |
11 | 3a403505273 |
12 | 17999120540 |
13 | 9847b39975 |
14 | 4d407b9b56 |
15 | 29d723086c |
hex | 17cee44100 |
102255313152 has 72 divisors (see below), whose sum is σ = 272602311520. Its totient is φ = 34028236800.
The previous prime is 102255313141. The next prime is 102255313183. The reversal of 102255313152 is 251313552201.
It is a super-2 number, since 2×1022553131522 (a number of 23 digits) contains 22 as substring.
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, 350799 + ... + 572337.
Almost surely, 2102255313152 is an apocalyptic number.
102255313152 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 102255313152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (136301155760).
102255313152 is an abundant number, since it is smaller than the sum of its proper divisors (170346998368).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102255313152 is an equidigital number, since it uses as much as digits as its factorization.
102255313152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 222159 (or 222145 counting only the distinct ones).
The product of its (nonzero) digits is 9000, while the sum is 30.
Adding to 102255313152 its reverse (251313552201), we get a palindrome (353568865353).
The spelling of 102255313152 in words is "one hundred two billion, two hundred fifty-five million, three hundred thirteen thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •