Base | Representation |
---|---|
bin | 101111011111110111… |
… | …1011001011011111100 |
3 | 100202021122002211020001 |
4 | 1132333233121123330 |
5 | 3132344241333040 |
6 | 114505250004044 |
7 | 10240453136401 |
oct | 1367757313374 |
9 | 322248084201 |
10 | 102001121020 |
11 | 3a292a78a27 |
12 | 17927b76624 |
13 | 980728a116 |
14 | 4d18b2c2a8 |
15 | 29bec6e59a |
hex | 17bfbd96fc |
102001121020 has 24 divisors (see below), whose sum is σ = 219426803568. Its totient is φ = 39805315200.
The previous prime is 102001120993. The next prime is 102001121029. The reversal of 102001121020 is 20121100201.
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 = 102001120988 and 102001121006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102001121029) 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, 62194986 + ... + 62196625.
It is an arithmetic number, because the mean of its divisors is an integer number (9142783482).
Almost surely, 2102001121020 is an apocalyptic number.
102001121020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
102001121020 is an abundant number, since it is smaller than the sum of its proper divisors (117425682548).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102001121020 is a wasteful number, since it uses less digits than its factorization.
102001121020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 124391661 (or 124391659 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 102001121020 its reverse (20121100201), we get a palindrome (122122221221).
The spelling of 102001121020 in words is "one hundred two billion, one million, one hundred twenty-one thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •