Base | Representation |
---|---|
bin | 11110000010010011110100… |
… | …001001010000010001000100 |
3 | 122022201122110210220100200212 |
4 | 132002103310021100101010 |
5 | 114303312011204104104 |
6 | 1144541541452254552 |
7 | 36552626610104252 |
oct | 3602236411202104 |
9 | 568648423810625 |
10 | 132100110222404 |
11 | 39100384417905 |
12 | 12995a77771458 |
13 | 5892caa40b63c |
14 | 24899725a15d2 |
15 | 10413612d436e |
hex | 7824f4250444 |
132100110222404 has 12 divisors (see below), whose sum is σ = 241226288232384. Its totient is φ = 63178313584584.
The previous prime is 132100110222391. The next prime is 132100110222499. The reversal of 132100110222404 is 404222011001231.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a self number, because there is not a number n which added to its sum of digits gives 132100110222404.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 717935381552 + ... + 717935381735.
It is an arithmetic number, because the mean of its divisors is an integer number (20102190686032).
Almost surely, 2132100110222404 is an apocalyptic number.
It is an amenable number.
132100110222404 is a deficient number, since it is larger than the sum of its proper divisors (109126178009980).
132100110222404 is a wasteful number, since it uses less digits than its factorization.
132100110222404 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1435870763314 (or 1435870763312 counting only the distinct ones).
The product of its (nonzero) digits is 768, while the sum is 23.
Adding to 132100110222404 its reverse (404222011001231), we get a palindrome (536322121223635).
The spelling of 132100110222404 in words is "one hundred thirty-two trillion, one hundred billion, one hundred ten million, two hundred twenty-two thousand, four hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •