Base | Representation |
---|---|
bin | 11001011000011… |
… | …00110100010111 |
3 | 112211122010022122 |
4 | 30230030310113 |
5 | 414001212211 |
6 | 33043250155 |
7 | 5163506603 |
oct | 1454146427 |
9 | 484563278 |
10 | 212913431 |
11 | aa203015 |
12 | 5b37995b |
13 | 35158ca3 |
14 | 203c4503 |
15 | 13a5a6db |
hex | cb0cd17 |
212913431 has 8 divisors (see below), whose sum is σ = 218199744. Its totient is φ = 207658720.
The previous prime is 212913427. The next prime is 212913443. The reversal of 212913431 is 134319212.
212913431 is digitally balanced in base 2, 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 212913431 - 22 = 212913427 is a prime.
It is a super-2 number, since 2×2129134312 = 90664258200383522, which contains 22 as substring.
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 212913431.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (212913731) 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, 6041 + ... + 21501.
It is an arithmetic number, because the mean of its divisors is an integer number (27274968).
Almost surely, 2212913431 is an apocalyptic number.
212913431 is a deficient number, since it is larger than the sum of its proper divisors (5286313).
212913431 is a wasteful number, since it uses less digits than its factorization.
212913431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15801.
The product of its digits is 1296, while the sum is 26.
The square root of 212913431 is about 14591.5534128481. The cubic root of 212913431 is about 597.1283436505.
The spelling of 212913431 in words is "two hundred twelve million, nine hundred thirteen thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •