Base | Representation |
---|---|
bin | 11110000001000100000111… |
… | …011111101101101100100011 |
3 | 122022102110120222000122010222 |
4 | 132001010013133231230203 |
5 | 114300411232044000144 |
6 | 1144434350153513255 |
7 | 36543510154166021 |
oct | 3601040737555443 |
9 | 568373528018128 |
10 | 132014535531299 |
11 | 390780607718a3 |
12 | 12981374a1282b |
13 | 5887bc0371045 |
14 | 24857752c9711 |
15 | 103e0036e02ee |
hex | 7811077edb23 |
132014535531299 has 2 divisors, whose sum is σ = 132014535531300. Its totient is φ = 132014535531298.
The previous prime is 132014535531227. The next prime is 132014535531301. The reversal of 132014535531299 is 992135535410231.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-132014535531299 is a prime.
It is a super-2 number, since 2×1320145355312992 (a number of 29 digits) contains 22 as substring.
Together with 132014535531301, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 132014535531299.
It is not a weakly prime, because it can be changed into another prime (132014535561299) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66007267765649 + 66007267765650.
It is an arithmetic number, because the mean of its divisors is an integer number (66007267765650).
Almost surely, 2132014535531299 is an apocalyptic number.
132014535531299 is a deficient number, since it is larger than the sum of its proper divisors (1).
132014535531299 is an equidigital number, since it uses as much as digits as its factorization.
132014535531299 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4374000, while the sum is 53.
The spelling of 132014535531299 in words is "one hundred thirty-two trillion, fourteen billion, five hundred thirty-five million, five hundred thirty-one thousand, two hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •