Base | Representation |
---|---|
bin | 101111101111001001… |
… | …0010111001010000000 |
3 | 100210121100102121121112 |
4 | 1133132102113022000 |
5 | 3134421440300300 |
6 | 115032154142452 |
7 | 10256245151501 |
oct | 1373622271200 |
9 | 323540377545 |
10 | 102513603200 |
11 | 3a526290418 |
12 | 17a4b721a28 |
13 | 98894c2808 |
14 | 4d66c12ba8 |
15 | 29eec50e35 |
hex | 17de497280 |
102513603200 has 144 divisors (see below), whose sum is σ = 267273599310. Its totient is φ = 38846822400.
The previous prime is 102513603197. The next prime is 102513603229. The reversal of 102513603200 is 2306315201.
It can be written as a sum of positive squares in 3 ways, for example, as 61460359744 + 41053243456 = 247912^2 + 202616^2 .
It is an unprimeable number.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 1110830 + ... + 1199570.
Almost surely, 2102513603200 is an apocalyptic number.
102513603200 is a gapful number since it is divisible by the number (10) 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 102513603200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (133636799655).
102513603200 is an abundant number, since it is smaller than the sum of its proper divisors (164759996110).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102513603200 is an equidigital number, since it uses as much as digits as its factorization.
102513603200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 88803 (or 88767 counting only the distinct ones).
The product of its (nonzero) digits is 1080, while the sum is 23.
Adding to 102513603200 its reverse (2306315201), we get a palindrome (104819918401).
The spelling of 102513603200 in words is "one hundred two billion, five hundred thirteen million, six hundred three thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •