Base | Representation |
---|---|
bin | 101110100100001111… |
… | …0100010100100111110 |
3 | 100120010012001011212002 |
4 | 1131020132202210332 |
5 | 3114300023311220 |
6 | 113534531342302 |
7 | 10140045534254 |
oct | 1351036424476 |
9 | 316105034762 |
10 | 100000213310 |
11 | 39456571398 |
12 | 17469a51992 |
13 | 957888586a |
14 | 4ba90b85d4 |
15 | 290427cc75 |
hex | 17487a293e |
100000213310 has 16 divisors (see below), whose sum is σ = 180004508496. Its totient is φ = 39999168768.
The previous prime is 100000213309. The next prime is 100000213321. The reversal of 100000213310 is 13312000001.
It is a super-2 number, since 2×1000002133102 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 100000213291 and 100000213300.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 501329 + ... + 671811.
It is an arithmetic number, because the mean of its divisors is an integer number (11250281781).
Almost surely, 2100000213310 is an apocalyptic number.
100000213310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
100000213310 is a deficient number, since it is larger than the sum of its proper divisors (80004295186).
100000213310 is a wasteful number, since it uses less digits than its factorization.
100000213310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 229147.
The product of its (nonzero) digits is 18, while the sum is 11.
Adding to 100000213310 its reverse (13312000001), we get a palindrome (113312213311).
The spelling of 100000213310 in words is "one hundred billion, two hundred thirteen thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •