Base | Representation |
---|---|
bin | 111101101100111101… |
… | …1010001110001000111 |
3 | 110200000111221022012101 |
4 | 1323121323101301013 |
5 | 4132332313322043 |
6 | 140512210332531 |
7 | 12400413510220 |
oct | 1733173216107 |
9 | 420014838171 |
10 | 132505214023 |
11 | 51216814546 |
12 | 2181b88a147 |
13 | c658c0b2b0 |
14 | 65b00b6247 |
15 | 36a7c6e24d |
hex | 1ed9ed1c47 |
132505214023 has 32 divisors (see below), whose sum is σ = 163612592640. Its totient is φ = 104499642240.
The previous prime is 132505214011. The next prime is 132505214029. The reversal of 132505214023 is 320412505231.
It is a de Polignac number, because none of the positive numbers 2k-132505214023 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 132505213982 and 132505214000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132505214029) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 58396933 + ... + 58399201.
It is an arithmetic number, because the mean of its divisors is an integer number (5112893520).
Almost surely, 2132505214023 is an apocalyptic number.
132505214023 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
132505214023 is a deficient number, since it is larger than the sum of its proper divisors (31107378617).
132505214023 is a wasteful number, since it uses less digits than its factorization.
132505214023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4087.
The product of its (nonzero) digits is 7200, while the sum is 28.
Adding to 132505214023 its reverse (320412505231), we get a palindrome (452917719254).
It can be divided in two parts, 132505 and 214023, that added together give a triangular number (346528 = T832).
The spelling of 132505214023 in words is "one hundred thirty-two billion, five hundred five million, two hundred fourteen thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •