Base | Representation |
---|---|
bin | 1001011110101101011100… |
… | …1101001010101011010101 |
3 | 1100220110002210222100221121 |
4 | 2113223113031022223111 |
5 | 2331233204002310031 |
6 | 34100204051443541 |
7 | 2124023433324163 |
oct | 227532715125325 |
9 | 40813083870847 |
10 | 10423201213141 |
11 | 3359500397232 |
12 | 1204104bb65b1 |
13 | 5a7b99446242 |
14 | 2806b27da233 |
15 | 1311e8645011 |
hex | 97ad734aad5 |
10423201213141 has 8 divisors (see below), whose sum is σ = 10433334445920. Its totient is φ = 10413068698032.
The previous prime is 10423201213133. The next prime is 10423201213171. The reversal of 10423201213141 is 14131210232401.
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 10423201213141 - 23 = 10423201213133 is a prime.
It is a super-2 number, since 2×104232012131412 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10423201213121) 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, 31609866 + ... + 31937908.
It is an arithmetic number, because the mean of its divisors is an integer number (1304166805740).
Almost surely, 210423201213141 is an apocalyptic number.
It is an amenable number.
10423201213141 is a deficient number, since it is larger than the sum of its proper divisors (10133232779).
10423201213141 is a wasteful number, since it uses less digits than its factorization.
10423201213141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 358835.
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 10423201213141 its reverse (14131210232401), we get a palindrome (24554411445542).
The spelling of 10423201213141 in words is "ten trillion, four hundred twenty-three billion, two hundred one million, two hundred thirteen thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •