Base | Representation |
---|---|
bin | 1100001110011011000… |
… | …0110111011111101011 |
3 | 202002010100111111000212 |
4 | 3003212300313133223 |
5 | 11420120140000412 |
6 | 240253023451335 |
7 | 21113511354554 |
oct | 3034660673753 |
9 | 662110444025 |
10 | 210030000107 |
11 | 81089506794 |
12 | 34856756b4b |
13 | 16a622b1695 |
14 | a24621332b |
15 | 56e3cab222 |
hex | 30e6c377eb |
210030000107 has 16 divisors (see below), whose sum is σ = 215976066432. Its totient is φ = 204172246080.
The previous prime is 210030000077. The next prime is 210030000109. The reversal of 210030000107 is 701000030012.
It is a cyclic number.
It is not a de Polignac number, because 210030000107 - 210 = 210029999083 is a prime.
It is a super-2 number, since 2×2100300001072 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 210030000091 and 210030000100.
It is not an unprimeable number, because it can be changed into a prime (210030000109) 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 15 ways as a sum of consecutive naturals, for example, 5023007 + ... + 5064647.
It is an arithmetic number, because the mean of its divisors is an integer number (13498504152).
Almost surely, 2210030000107 is an apocalyptic number.
210030000107 is a deficient number, since it is larger than the sum of its proper divisors (5946066325).
210030000107 is an equidigital number, since it uses as much as digits as its factorization.
210030000107 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42698.
The product of its (nonzero) digits is 42, while the sum is 14.
Adding to 210030000107 its reverse (701000030012), we get a palindrome (911030030119).
The spelling of 210030000107 in words is "two hundred ten billion, thirty million, one hundred seven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •