Base | Representation |
---|---|
bin | 11110000011000010111001… |
… | …001110101111101001011101 |
3 | 122022220110221210212221022121 |
4 | 132003002321032233221131 |
5 | 114310124023310212334 |
6 | 1145021101543542541 |
7 | 36556366404122116 |
oct | 3603027116575135 |
9 | 568813853787277 |
10 | 132150661413469 |
11 | 3911a865230966 |
12 | 129a382515aa51 |
13 | 58979a5417a0a |
14 | 248c1aa1b120d |
15 | 104281e254db4 |
hex | 7830b93afa5d |
132150661413469 has 2 divisors, whose sum is σ = 132150661413470. Its totient is φ = 132150661413468.
The previous prime is 132150661413461. The next prime is 132150661413553. The reversal of 132150661413469 is 964314166051231.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 69759461997369 + 62391199416100 = 8352213^2 + 7898810^2 .
It is a cyclic number.
It is not a de Polignac number, because 132150661413469 - 23 = 132150661413461 is a prime.
It is a super-2 number, since 2×1321506614134692 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (132150661413461) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66075330706734 + 66075330706735.
It is an arithmetic number, because the mean of its divisors is an integer number (66075330706735).
Almost surely, 2132150661413469 is an apocalyptic number.
It is an amenable number.
132150661413469 is a deficient number, since it is larger than the sum of its proper divisors (1).
132150661413469 is an equidigital number, since it uses as much as digits as its factorization.
132150661413469 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2799360, while the sum is 52.
The spelling of 132150661413469 in words is "one hundred thirty-two trillion, one hundred fifty billion, six hundred sixty-one million, four hundred thirteen thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •