Base | Representation |
---|---|
bin | 11110001100000010110001… |
… | …101011110010101100001001 |
3 | 122102002121000121000220012112 |
4 | 132030002301223302230021 |
5 | 114400241413041213001 |
6 | 1150213124034152105 |
7 | 36652146561212021 |
oct | 3614026153625411 |
9 | 572077017026175 |
10 | 132769010101001 |
11 | 39339025a14a2a |
12 | 12a83634a22635 |
13 | 59110aa5bc481 |
14 | 24b00a92caa81 |
15 | 105395eda5cbb |
hex | 78c0b1af2b09 |
132769010101001 has 2 divisors, whose sum is σ = 132769010101002. Its totient is φ = 132769010101000.
The previous prime is 132769010100989. The next prime is 132769010101019. The reversal of 132769010101001 is 100101010967231.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 132711206401225 + 57803699776 = 11520035^2 + 240424^2 .
It is an emirp because it is prime and its reverse (100101010967231) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 132769010101001 - 226 = 132768942992137 is a prime.
It is a super-2 number, since 2×1327690101010012 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (132769010101201) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66384505050500 + 66384505050501.
It is an arithmetic number, because the mean of its divisors is an integer number (66384505050501).
Almost surely, 2132769010101001 is an apocalyptic number.
It is an amenable number.
132769010101001 is a deficient number, since it is larger than the sum of its proper divisors (1).
132769010101001 is an equidigital number, since it uses as much as digits as its factorization.
132769010101001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2268, while the sum is 32.
The spelling of 132769010101001 in words is "one hundred thirty-two trillion, seven hundred sixty-nine billion, ten million, one hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •