Base | Representation |
---|---|
bin | 101111100000001000… |
… | …1010001101001010000 |
3 | 100202022020211000122020 |
4 | 1133000101101221100 |
5 | 3132404030031000 |
6 | 114510204211440 |
7 | 10240621465434 |
oct | 1370021215120 |
9 | 322266730566 |
10 | 102010002000 |
11 | 3a297a94385 |
12 | 1792ab39b80 |
13 | 980907953a |
14 | 4d19da09c4 |
15 | 29c0925ba0 |
hex | 17c0451a50 |
102010002000 has 80 divisors (see below), whose sum is σ = 328880265792. Its totient is φ = 27202665600.
The previous prime is 102010001959. The next prime is 102010002011. The reversal of 102010002000 is 200010201.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (80).
It is a Harshad number since it is a multiple of its sum of digits (6).
It is a super Niven number, because it is divisible the sum of any subset of its (nonzero) digits.
It is a self number, because there is not a number n which added to its sum of digits gives 102010002000.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8494834 + ... + 8506833.
Almost surely, 2102010002000 is an apocalyptic number.
102010002000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
102010002000 is an abundant number, since it is smaller than the sum of its proper divisors (226870263792).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102010002000 is a wasteful number, since it uses less digits than its factorization.
102010002000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17001693 (or 17001677 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 6.
Adding to 102010002000 its reverse (200010201), we get a palindrome (102210012201).
The spelling of 102010002000 in words is "one hundred two billion, ten million, two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •