Base | Representation |
---|---|
bin | 101111110000000011010000… |
… | …101111011110001000001001 |
3 | 1000112120210002112021001011101 |
4 | 233300003100233132020021 |
5 | 210011301414042312223 |
6 | 2022353210425101401 |
7 | 62143511050065655 |
oct | 5760032057361011 |
9 | 1015523075231141 |
10 | 210010223010313 |
11 | 60a08920a30320 |
12 | 1b67947a927861 |
13 | 9024b5738751b |
14 | 39c0798767a65 |
15 | 1942cab7424ad |
hex | bf00d0bde209 |
210010223010313 has 4 divisors (see below), whose sum is σ = 229102061465808. Its totient is φ = 190918384554820.
The previous prime is 210010223010311. The next prime is 210010223010353. The reversal of 210010223010313 is 313010322010012.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 210010223010313 - 21 = 210010223010311 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (210010223010311) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9545919227731 + ... + 9545919227752.
It is an arithmetic number, because the mean of its divisors is an integer number (57275515366452).
Almost surely, 2210010223010313 is an apocalyptic number.
It is an amenable number.
210010223010313 is a deficient number, since it is larger than the sum of its proper divisors (19091838455495).
210010223010313 is a wasteful number, since it uses less digits than its factorization.
210010223010313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19091838455494.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 210010223010313 its reverse (313010322010012), we get a palindrome (523020545020325).
The spelling of 210010223010313 in words is "two hundred ten trillion, ten billion, two hundred twenty-three million, ten thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •