Base | Representation |
---|---|
bin | 1100001111001101111… |
… | …0111110100110011111 |
3 | 202002200020002001110002 |
4 | 3003303132332212133 |
5 | 11421034303230211 |
6 | 240330130004515 |
7 | 21122012352011 |
oct | 3036336764637 |
9 | 662606061402 |
10 | 210243414431 |
11 | 81188a21066 |
12 | 348b611673b |
13 | 16a9758464b |
14 | a2666c81b1 |
15 | 57078b503b |
hex | 30f37be99f |
210243414431 has 8 divisors (see below), whose sum is σ = 211793927904. Its totient is φ = 208693131520.
The previous prime is 210243414427. The next prime is 210243414463. The reversal of 210243414431 is 134414342012.
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 210243414431 - 22 = 210243414427 is a prime.
It is a super-2 number, since 2×2102434144312 (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 = 210243414394 and 210243414403.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210243414331) 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, 2057591 + ... + 2157351.
It is an arithmetic number, because the mean of its divisors is an integer number (26474240988).
Almost surely, 2210243414431 is an apocalyptic number.
210243414431 is a deficient number, since it is larger than the sum of its proper divisors (1550513473).
210243414431 is a wasteful number, since it uses less digits than its factorization.
210243414431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 115281.
The product of its (nonzero) digits is 9216, while the sum is 29.
Adding to 210243414431 its reverse (134414342012), we get a palindrome (344657756443).
The spelling of 210243414431 in words is "two hundred ten billion, two hundred forty-three million, four hundred fourteen thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •