Base | Representation |
---|---|
bin | 101111100011101101… |
… | …1110011100110001101 |
3 | 100202121121222212102220 |
4 | 1133013123303212031 |
5 | 3133130312444041 |
6 | 114530140405553 |
7 | 10243611254640 |
oct | 1370733634615 |
9 | 322547885386 |
10 | 102130203021 |
11 | 3a349923170 |
12 | 179632468b9 |
13 | 9827c43ac2 |
14 | 4d2bd2da57 |
15 | 29cb26ad66 |
hex | 17c76f398d |
102130203021 has 64 divisors (see below), whose sum is σ = 175763644416. Its totient is φ = 51214118400.
The previous prime is 102130203013. The next prime is 102130203023. The reversal of 102130203021 is 120302031201.
It is not a de Polignac number, because 102130203021 - 23 = 102130203013 is a prime.
It is a super-2 number, since 2×1021302030212 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102130203023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 728131 + ... + 856991.
It is an arithmetic number, because the mean of its divisors is an integer number (2746306944).
Almost surely, 2102130203021 is an apocalyptic number.
102130203021 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
102130203021 is a deficient number, since it is larger than the sum of its proper divisors (73633441395).
102130203021 is a wasteful number, since it uses less digits than its factorization.
102130203021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 129002.
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 102130203021 its reverse (120302031201), we get a palindrome (222432234222).
The spelling of 102130203021 in words is "one hundred two billion, one hundred thirty million, two hundred three thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •