Base | Representation |
---|---|
bin | 10011000001011001… |
… | …00000000111100111 |
3 | 222100201002011221101 |
4 | 21200230200013213 |
5 | 131403311310343 |
6 | 4405203100531 |
7 | 511032244252 |
oct | 114054400747 |
9 | 28321064841 |
10 | 10212213223 |
11 | 4370589a43 |
12 | 1b90071747 |
13 | c6995c824 |
14 | 6cc404099 |
15 | 3eb82ae4d |
hex | 260b201e7 |
10212213223 has 8 divisors (see below), whose sum is σ = 10568205440. Its totient is φ = 9857881440.
The previous prime is 10212213199. The next prime is 10212213239. The reversal of 10212213223 is 32231221201.
10212213223 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
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 10212213223 - 29 = 10212212711 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10212213223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10212213283) 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, 402588 + ... + 427201.
It is an arithmetic number, because the mean of its divisors is an integer number (1321025680).
Almost surely, 210212213223 is an apocalyptic number.
10212213223 is a deficient number, since it is larger than the sum of its proper divisors (355992217).
10212213223 is an equidigital number, since it uses as much as digits as its factorization.
10212213223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 830217.
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 10212213223 its reverse (32231221201), we get a palindrome (42443434424).
The spelling of 10212213223 in words is "ten billion, two hundred twelve million, two hundred thirteen thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •