Base | Representation |
---|---|
bin | 101111011111110111… |
… | …1010111001111010100 |
3 | 100202021122002100212201 |
4 | 1132333233113033110 |
5 | 3132344241041040 |
6 | 114505245454244 |
7 | 10240453101223 |
oct | 1367757271724 |
9 | 322248070781 |
10 | 102001112020 |
11 | 3a292a72195 |
12 | 17927b71384 |
13 | 9807285cb2 |
14 | 4d18b28cba |
15 | 29bec6ba9a |
hex | 17bfbd73d4 |
102001112020 has 24 divisors (see below), whose sum is σ = 225476143200. Its totient is φ = 38653052832.
The previous prime is 102001112009. The next prime is 102001112023. The reversal of 102001112020 is 20211100201.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a junction number, because it is equal to n+sod(n) for n = 102001111988 and 102001112006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102001112023) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 134211610 + ... + 134212369.
It is an arithmetic number, because the mean of its divisors is an integer number (9394839300).
Almost surely, 2102001112020 is an apocalyptic number.
102001112020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
102001112020 is an abundant number, since it is smaller than the sum of its proper divisors (123475031180).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102001112020 is a wasteful number, since it uses less digits than its factorization.
102001112020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 268424007 (or 268424005 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 102001112020 its reverse (20211100201), we get a palindrome (122212212221).
The spelling of 102001112020 in words is "one hundred two billion, one million, one hundred twelve thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •