Base | Representation |
---|---|
bin | 101111100000110010… |
… | …1101000001001000000 |
3 | 100202100210102102221002 |
4 | 1133001211220021000 |
5 | 3132430210123430 |
6 | 114512314151132 |
7 | 10241310442550 |
oct | 1370145501100 |
9 | 322323372832 |
10 | 102032114240 |
11 | 3a2a9517661 |
12 | 179364224a8 |
13 | 981081c1c4 |
14 | 4d1ccb9160 |
15 | 29c2842845 |
hex | 17c1968240 |
102032114240 has 224 divisors, whose sum is σ = 290161211904. Its totient is φ = 33413529600.
The previous prime is 102032114237. The next prime is 102032114251. The reversal of 102032114240 is 42411230201.
It is a tau number, because it is divible by the number of its divisors (224).
It is a Harshad number since it is a multiple of its sum of digits (20).
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, 63729440 + ... + 63731040.
Almost surely, 2102032114240 is an apocalyptic number.
102032114240 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 102032114240, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (145080605952).
102032114240 is an abundant number, since it is smaller than the sum of its proper divisors (188129097664).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102032114240 is a wasteful number, since it uses less digits than its factorization.
102032114240 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2885 (or 2875 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 102032114240 its reverse (42411230201), we get a palindrome (144443344441).
The spelling of 102032114240 in words is "one hundred two billion, thirty-two million, one hundred fourteen thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •