Base | Representation |
---|---|
bin | 10111001100010011001100… |
… | …001111101100110001100110 |
3 | 111101011010121222111200011212 |
4 | 113030103030033230301212 |
5 | 101332133113330404110 |
6 | 1000534143500231422 |
7 | 30325164524542352 |
oct | 2714231417546146 |
9 | 441133558450155 |
10 | 102000310013030 |
11 | 2a5560a7950380 |
12 | b53441553b572 |
13 | 44bb7849a2880 |
14 | 1b28bac920462 |
15 | bbd3dead7e05 |
hex | 5cc4cc3ecc66 |
102000310013030 has 64 divisors (see below), whose sum is σ = 217677443860800. Its totient is φ = 33923757381120.
The previous prime is 102000310013027. The next prime is 102000310013039. The reversal of 102000310013030 is 30310013000201.
It is a junction number, because it is equal to n+sod(n) for n = 102000310012996 and 102000310013014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102000310013039) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 327040865 + ... + 327352604.
It is an arithmetic number, because the mean of its divisors is an integer number (3401210060325).
Almost surely, 2102000310013030 is an apocalyptic number.
102000310013030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
102000310013030 is an abundant number, since it is smaller than the sum of its proper divisors (115677133847770).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102000310013030 is a wasteful number, since it uses less digits than its factorization.
102000310013030 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 654393609.
The product of its (nonzero) digits is 54, while the sum is 14.
Adding to 102000310013030 its reverse (30310013000201), we get a palindrome (132310323013231).
The spelling of 102000310013030 in words is "one hundred two trillion, three hundred ten million, thirteen thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •