Base | Representation |
---|---|
bin | 11110000110110111001101… |
… | …110101111000010101011000 |
3 | 122100211120002122122012202220 |
4 | 132012313031311320111120 |
5 | 114323423311024101130 |
6 | 1145341405331024040 |
7 | 36614344404161526 |
oct | 3606671565702530 |
9 | 570746078565686 |
10 | 132413000222040 |
11 | 3921104669766a |
12 | 12a26639a3b020 |
13 | 58b66528a6665 |
14 | 249ab755d7316 |
15 | 1049575417410 |
hex | 786dcdd78558 |
132413000222040 has 64 divisors (see below), whose sum is σ = 397242620344800. Its totient is φ = 35309811643392.
The previous prime is 132413000222033. The next prime is 132413000222101. The reversal of 132413000222040 is 40222000314231.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a self number, because there is not a number n which added to its sum of digits gives 132413000222040.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8344434 + ... + 18288126.
Almost surely, 2132413000222040 is an apocalyptic number.
132413000222040 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
132413000222040 is an abundant number, since it is smaller than the sum of its proper divisors (264829620122760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132413000222040 is a wasteful number, since it uses less digits than its factorization.
132413000222040 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10054676 (or 10054672 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 24.
Adding to 132413000222040 its reverse (40222000314231), we get a palindrome (172635000536271).
The spelling of 132413000222040 in words is "one hundred thirty-two trillion, four hundred thirteen billion, two hundred twenty-two thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •