Base | Representation |
---|---|
bin | 1100001110010110010… |
… | …1011010111011101001 |
3 | 202002001222021122222222 |
4 | 3003211211122323221 |
5 | 11420100104103223 |
6 | 240251035523425 |
7 | 21113151302423 |
oct | 3034545327351 |
9 | 662058248888 |
10 | 210010222313 |
11 | 81079328401 |
12 | 3484bbb9575 |
13 | 16a5b178448 |
14 | a243745813 |
15 | 56e21a10c8 |
hex | 30e595aee9 |
210010222313 has 32 divisors (see below), whose sum is σ = 233234277120. Its totient is φ = 188085821440.
The previous prime is 210010222309. The next prime is 210010222321. The reversal of 210010222313 is 313222010012.
It is a cyclic number.
It is not a de Polignac number, because 210010222313 - 22 = 210010222309 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a junction number, because it is equal to n+sod(n) for n = 210010222291 and 210010222300.
It is not an unprimeable number, because it can be changed into a prime (210010222813) 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, 69058073 + ... + 69061113.
It is an arithmetic number, because the mean of its divisors is an integer number (7288571160).
Almost surely, 2210010222313 is an apocalyptic number.
210010222313 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
It is an amenable number.
210010222313 is a deficient number, since it is larger than the sum of its proper divisors (23224054807).
210010222313 is a wasteful number, since it uses less digits than its factorization.
210010222313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3937.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 210010222313 its reverse (313222010012), we get a palindrome (523232232325).
The spelling of 210010222313 in words is "two hundred ten billion, ten million, two hundred twenty-two thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.371 sec. • engine limits •