Base | Representation |
---|---|
bin | 1001001100000000111000… |
… | …1111110111011001110110 |
3 | 1022202202000220012211211011 |
4 | 2103000032033313121312 |
5 | 2311002400020322220 |
6 | 33252443512302434 |
7 | 2061563013145252 |
oct | 223001617673166 |
9 | 38682026184734 |
10 | 10102002120310 |
11 | 3245264924801 |
12 | 1171a040a1a1a |
13 | 5837cb6a5429 |
14 | 26cd2203b262 |
15 | 127b99d0d65a |
hex | 9300e3f7676 |
10102002120310 has 16 divisors (see below), whose sum is σ = 18208893960000. Its totient is φ = 4035180816256.
The previous prime is 10102002120253. The next prime is 10102002120317. The reversal of 10102002120310 is 1302120020101.
It is a super-2 number, since 2×101020021203102 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10102002120317) 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 7 ways as a sum of consecutive naturals, for example, 702496435 + ... + 702510814.
It is an arithmetic number, because the mean of its divisors is an integer number (1138055872500).
Almost surely, 210102002120310 is an apocalyptic number.
10102002120310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10102002120310 is a deficient number, since it is larger than the sum of its proper divisors (8106891839690).
10102002120310 is a wasteful number, since it uses less digits than its factorization.
10102002120310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1405007975.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 10102002120310 its reverse (1302120020101), we get a palindrome (11404122140411).
The spelling of 10102002120310 in words is "ten trillion, one hundred two billion, two million, one hundred twenty thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •