Base | Representation |
---|---|
bin | 1100001110110000100… |
… | …0111101100001001001 |
3 | 202002100122020020012022 |
4 | 3003230020331201021 |
5 | 11420311232433223 |
6 | 240310005054225 |
7 | 21115655152010 |
oct | 3035410754111 |
9 | 662318206168 |
10 | 210120202313 |
11 | 81125415a6a |
12 | 348809b7375 |
13 | 16a77ba4678 |
14 | a2541b3a77 |
15 | 56ebb77ac8 |
hex | 30ec23d849 |
210120202313 has 8 divisors (see below), whose sum is σ = 240249762432. Its totient is φ = 180018739296.
The previous prime is 210120202297. The next prime is 210120202337. The reversal of 210120202313 is 313202021012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 210120202313 - 24 = 210120202297 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 210120202291 and 210120202300.
It is not an unprimeable number, because it can be changed into a prime (210120202013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7008245 + ... + 7038162.
It is an arithmetic number, because the mean of its divisors is an integer number (30031220304).
Almost surely, 2210120202313 is an apocalyptic number.
It is an amenable number.
210120202313 is a deficient number, since it is larger than the sum of its proper divisors (30129560119).
210120202313 is a wasteful number, since it uses less digits than its factorization.
210120202313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14048551.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 210120202313 its reverse (313202021012), we get a palindrome (523322223325).
The spelling of 210120202313 in words is "two hundred ten billion, one hundred twenty million, two hundred two thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •