Base | Representation |
---|---|
bin | 11110000010010011110011… |
… | …100110011101000111100001 |
3 | 122022201122110011201220010002 |
4 | 132002103303212131013201 |
5 | 114303312001340200001 |
6 | 1144541540524545345 |
7 | 36552626436421316 |
oct | 3602236346350741 |
9 | 568648404656102 |
10 | 132100101100001 |
11 | 3910037a257031 |
12 | 12995a746b2255 |
13 | 5892ca8566378 |
14 | 24899712a8d0d |
15 | 10413605d146b |
hex | 7824f399d1e1 |
132100101100001 has 16 divisors (see below), whose sum is σ = 144501683286528. Its totient is φ = 120219685920000.
The previous prime is 132100101099997. The next prime is 132100101100003. The reversal of 132100101100001 is 100001101001231.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 132100101100001 - 22 = 132100101099997 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (132100101100003) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 102684875 + ... + 103963376.
It is an arithmetic number, because the mean of its divisors is an integer number (9031355205408).
Almost surely, 2132100101100001 is an apocalyptic number.
It is an amenable number.
132100101100001 is a deficient number, since it is larger than the sum of its proper divisors (12401582186527).
132100101100001 is a wasteful number, since it uses less digits than its factorization.
132100101100001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 206649512.
The product of its (nonzero) digits is 6, while the sum is 11.
Adding to 132100101100001 its reverse (100001101001231), we get a palindrome (232101202101232).
It can be divided in two parts, 132100 and 101100001, that added together give a palindrome (101232101).
The spelling of 132100101100001 in words is "one hundred thirty-two trillion, one hundred billion, one hundred one million, one hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •