Base | Representation |
---|---|
bin | 11110000010101001001111… |
… | …001010000101010110111001 |
3 | 122022210211211211210212210202 |
4 | 132002221033022011112321 |
5 | 114304201113133044001 |
6 | 1145000304132251545 |
7 | 36554402612031140 |
oct | 3602511712052671 |
9 | 568724754725722 |
10 | 132123112003001 |
11 | 3910a108313039 |
12 | 1299a416a70bb5 |
13 | 58952049720c2 |
14 | 248ab153d4757 |
15 | 1041c5a84696b |
hex | 782a4f2855b9 |
132123112003001 has 16 divisors (see below), whose sum is σ = 154131233384448. Its totient is φ = 110906237707200.
The previous prime is 132123112002997. The next prime is 132123112003027. The reversal of 132123112003001 is 100300211321231.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 132123112003001 - 22 = 132123112002997 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (132123112003031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 328936985 + ... + 329338406.
It is an arithmetic number, because the mean of its divisors is an integer number (9633202086528).
Almost surely, 2132123112003001 is an apocalyptic number.
It is an amenable number.
132123112003001 is a deficient number, since it is larger than the sum of its proper divisors (22008121381447).
132123112003001 is an equidigital number, since it uses as much as digits as its factorization.
132123112003001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 658275992.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 132123112003001 its reverse (100300211321231), we get a palindrome (232423323324232).
The spelling of 132123112003001 in words is "one hundred thirty-two trillion, one hundred twenty-three billion, one hundred twelve million, three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •