Base | Representation |
---|---|
bin | 11110000010111101010100… |
… | …001101000101010111000011 |
3 | 122022212220111100211102020011 |
4 | 132002331110031011113003 |
5 | 114310024241401341003 |
6 | 1145014231331325351 |
7 | 36556065101603413 |
oct | 3602752415052703 |
9 | 568786440742204 |
10 | 132144671512003 |
11 | 39118271078277 |
12 | 129a2633150857 |
13 | 589725c476617 |
14 | 248bb9c870643 |
15 | 10425bd46446d |
hex | 782f543455c3 |
132144671512003 has 2 divisors, whose sum is σ = 132144671512004. Its totient is φ = 132144671512002.
The previous prime is 132144671511973. The next prime is 132144671512019. The reversal of 132144671512003 is 300215176441231.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 132144671512003 - 29 = 132144671511491 is a prime.
It is not a weakly prime, because it can be changed into another prime (132144671512043) 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 as a sum of consecutive naturals, namely, 66072335756001 + 66072335756002.
It is an arithmetic number, because the mean of its divisors is an integer number (66072335756002).
Almost surely, 2132144671512003 is an apocalyptic number.
132144671512003 is a deficient number, since it is larger than the sum of its proper divisors (1).
132144671512003 is an equidigital number, since it uses as much as digits as its factorization.
132144671512003 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 120960, while the sum is 40.
The spelling of 132144671512003 in words is "one hundred thirty-two trillion, one hundred forty-four billion, six hundred seventy-one million, five hundred twelve thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •