Base | Representation |
---|---|
bin | 1001001101110001000100… |
… | …0000100110001011010111 |
3 | 1022212121202101120012202010 |
4 | 2103130101000212023113 |
5 | 2312001031441022221 |
6 | 33314343433515303 |
7 | 2064010132236645 |
oct | 223342100461327 |
9 | 38777671505663 |
10 | 10132113220311 |
11 | 3257006850915 |
12 | 1177808272b33 |
13 | 5865b9a99474 |
14 | 27057b126195 |
15 | 12885d580c76 |
hex | 937110262d7 |
10132113220311 has 4 divisors (see below), whose sum is σ = 13509484293752. Its totient is φ = 6754742146872.
The previous prime is 10132113220259. The next prime is 10132113220343. The reversal of 10132113220311 is 11302231123101.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 10132113220311 - 26 = 10132113220247 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10132113220711) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1688685536716 + ... + 1688685536721.
It is an arithmetic number, because the mean of its divisors is an integer number (3377371073438).
Almost surely, 210132113220311 is an apocalyptic number.
10132113220311 is a deficient number, since it is larger than the sum of its proper divisors (3377371073441).
10132113220311 is an equidigital number, since it uses as much as digits as its factorization.
10132113220311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3377371073440.
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 10132113220311 its reverse (11302231123101), we get a palindrome (21434344343412).
The spelling of 10132113220311 in words is "ten trillion, one hundred thirty-two billion, one hundred thirteen million, two hundred twenty thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •