Base | Representation |
---|---|
bin | 1100001110110001010… |
… | …0110111011011111011 |
3 | 202002100212002210011011 |
4 | 3003230110313123323 |
5 | 11420313032320011 |
6 | 240310200014351 |
7 | 21116023530421 |
oct | 3035424673373 |
9 | 662325083134 |
10 | 210123323131 |
11 | 81127157757 |
12 | 34881a613b7 |
13 | 16a78727cc7 |
14 | a254787111 |
15 | 56ec092621 |
hex | 30ec5376fb |
210123323131 has 8 divisors (see below), whose sum is σ = 210833449200. Its totient is φ = 209414364000.
The previous prime is 210123323129. The next prime is 210123323153. The reversal of 210123323131 is 131323321012.
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 210123323131 - 21 = 210123323129 is a prime.
It is a super-2 number, since 2×2101233231312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (210123323171) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 69756 + ... + 652006.
It is an arithmetic number, because the mean of its divisors is an integer number (26354181150).
Almost surely, 2210123323131 is an apocalyptic number.
210123323131 is a deficient number, since it is larger than the sum of its proper divisors (710126069).
210123323131 is an equidigital number, since it uses as much as digits as its factorization.
210123323131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 583469.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 210123323131 its reverse (131323321012), we get a palindrome (341446644143).
The spelling of 210123323131 in words is "two hundred ten billion, one hundred twenty-three million, three hundred twenty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •