Base | Representation |
---|---|
bin | 101111100000101110… |
… | …1100111001101111101 |
3 | 100202100122110200222211 |
4 | 1133001131213031331 |
5 | 3132424140411214 |
6 | 114512201140421 |
7 | 10241253542440 |
oct | 1370135471575 |
9 | 322318420884 |
10 | 102030013309 |
11 | 3a2a8312154 |
12 | 1793578a711 |
13 | 9810264b53 |
14 | 4d1c8cd657 |
15 | 29c257a0c4 |
hex | 17c176737d |
102030013309 has 32 divisors (see below), whose sum is σ = 125213414400. Its totient is φ = 81286813440.
The previous prime is 102030013231. The next prime is 102030013321. The reversal of 102030013309 is 903310030201.
It is not a de Polignac number, because 102030013309 - 27 = 102030013181 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 102030013309.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102030013339) 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 31 ways as a sum of consecutive naturals, for example, 494347 + ... + 669655.
It is an arithmetic number, because the mean of its divisors is an integer number (3912919200).
Almost surely, 2102030013309 is an apocalyptic number.
It is an amenable number.
102030013309 is a deficient number, since it is larger than the sum of its proper divisors (23183401091).
102030013309 is a wasteful number, since it uses less digits than its factorization.
102030013309 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 175453.
The product of its (nonzero) digits is 486, while the sum is 22.
The spelling of 102030013309 in words is "one hundred two billion, thirty million, thirteen thousand, three hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •