Base | Representation |
---|---|
bin | 1100010010110101001… |
… | …0000100101100000111 |
3 | 202012011210201200201122 |
4 | 3010231102010230013 |
5 | 11430031024010043 |
6 | 241010245544155 |
7 | 21155025545606 |
oct | 3045522045407 |
9 | 665153650648 |
10 | 211213110023 |
11 | 81636326783 |
12 | 34b26a1505b |
13 | 16bc0441116 |
14 | a3193c7a3d |
15 | 5762aac368 |
hex | 312d484b07 |
211213110023 has 8 divisors (see below), whose sum is σ = 211654663920. Its totient is φ = 210771745920.
The previous prime is 211213110001. The next prime is 211213110067. The reversal of 211213110023 is 320011312112.
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 211213110023 - 226 = 211146001159 is a prime.
It is a super-2 number, since 2×2112131100232 (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 = 211213109983 and 211213110010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211213110323) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2301308 + ... + 2391326.
It is an arithmetic number, because the mean of its divisors is an integer number (26456832990).
Almost surely, 2211213110023 is an apocalyptic number.
211213110023 is a deficient number, since it is larger than the sum of its proper divisors (441553897).
211213110023 is an equidigital number, since it uses as much as digits as its factorization.
211213110023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 94897.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 211213110023 its reverse (320011312112), we get a palindrome (531224422135).
The spelling of 211213110023 in words is "two hundred eleven billion, two hundred thirteen million, one hundred ten thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •