Base | Representation |
---|---|
bin | 1100001010010… |
… | …01100110000000 |
3 | 21002221210221211 |
4 | 12011021212000 |
5 | 202103411222 |
6 | 14042255504 |
7 | 2346045622 |
oct | 605114600 |
9 | 232853854 |
10 | 102013312 |
11 | 52647125 |
12 | 2a1b7594 |
13 | 1819a00b |
14 | d796c12 |
15 | 8e51277 |
hex | 6149980 |
102013312 has 64 divisors (see below), whose sum is σ = 214640640. Its totient is φ = 48222720.
The previous prime is 102013259. The next prime is 102013361. The reversal of 102013312 is 213310201.
It is a tau number, because it is divible by the number of its divisors (64).
It is a junction number, because it is equal to n+sod(n) for n = 102013292 and 102013301.
It is a congruent number.
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, 186223 + ... + 186769.
It is an arithmetic number, because the mean of its divisors is an integer number (3353760).
Almost surely, 2102013312 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 102013312, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (107320320).
102013312 is an abundant number, since it is smaller than the sum of its proper divisors (112627328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102013312 is an equidigital number, since it uses as much as digits as its factorization.
102013312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 639 (or 627 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 13.
The square root of 102013312 is about 10100.1639590652. The cubic root of 102013312 is about 467.2531981082.
Adding to 102013312 its reverse (213310201), we get a palindrome (315323513).
The spelling of 102013312 in words is "one hundred two million, thirteen thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •