Base | Representation |
---|---|
bin | 1001001110010011101101… |
… | …0100111111001010101011 |
3 | 1022220111202112000020122000 |
4 | 2103210323110333022223 |
5 | 2312124103231040321 |
6 | 33322522331302043 |
7 | 2064456446256540 |
oct | 223447324771253 |
9 | 38814675006560 |
10 | 10141413143211 |
11 | 325aa49373609 |
12 | 11795828aa923 |
13 | 58743c71b41c |
14 | 270bc02d0bc7 |
15 | 128c04c53826 |
hex | 9393b53f2ab |
10141413143211 has 32 divisors (see below), whose sum is σ = 17210301803520. Its totient is φ = 5781709590912.
The previous prime is 10141413143203. The next prime is 10141413143249. The reversal of 10141413143211 is 11234131414101.
10141413143211 is a `hidden beast` number, since 1 + 0 + 1 + 414 + 1 + 31 + 4 + 3 + 211 = 666.
It is not a de Polignac number, because 10141413143211 - 23 = 10141413143203 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (10141413143011) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 61879215 + ... + 62042888.
It is an arithmetic number, because the mean of its divisors is an integer number (537821931360).
Almost surely, 210141413143211 is an apocalyptic number.
10141413143211 is a deficient number, since it is larger than the sum of its proper divisors (7068888660309).
10141413143211 is a wasteful number, since it uses less digits than its factorization.
10141413143211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 123922552 (or 123922546 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 27.
Adding to 10141413143211 its reverse (11234131414101), we get a palindrome (21375544557312).
The spelling of 10141413143211 in words is "ten trillion, one hundred forty-one billion, four hundred thirteen million, one hundred forty-three thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •