Base | Representation |
---|---|
bin | 1001001101110001001010… |
… | …0111100001110110010011 |
3 | 1022212121211021100002121012 |
4 | 2103130102213201312103 |
5 | 2312001110343002121 |
6 | 33314350240121135 |
7 | 2064010610501612 |
oct | 223342247416623 |
9 | 38777737302535 |
10 | 10132140203411 |
11 | 32570200006a6 |
12 | 11778153061ab |
13 | 5865c25561b5 |
14 | 27058094b879 |
15 | 128860b10c5b |
hex | 937129e1d93 |
10132140203411 has 4 divisors (see below), whose sum is σ = 10230510496752. Its totient is φ = 10033769910072.
The previous prime is 10132140203407. The next prime is 10132140203429. The reversal of 10132140203411 is 11430204123101.
10132140203411 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 10132140203411 - 22 = 10132140203407 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10132140203111) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 49185146516 + ... + 49185146721.
It is an arithmetic number, because the mean of its divisors is an integer number (2557627624188).
Almost surely, 210132140203411 is an apocalyptic number.
10132140203411 is a deficient number, since it is larger than the sum of its proper divisors (98370293341).
10132140203411 is an equidigital number, since it uses as much as digits as its factorization.
10132140203411 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 98370293340.
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 10132140203411 its reverse (11430204123101), we get a palindrome (21562344326512).
The spelling of 10132140203411 in words is "ten trillion, one hundred thirty-two billion, one hundred forty million, two hundred three thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •