Base | Representation |
---|---|
bin | 111101101010100000… |
… | …1101100011111000000 |
3 | 110122210210020220210211 |
4 | 1323111001230133000 |
5 | 4132200242311430 |
6 | 140500112403504 |
7 | 12365365005103 |
oct | 1732501543700 |
9 | 418723226724 |
10 | 132423010240 |
11 | 51184378634 |
12 | 217b8246594 |
13 | c644b88ac1 |
14 | 65a31d873a |
15 | 36a093272a |
hex | 1ed506c7c0 |
132423010240 has 56 divisors (see below), whose sum is σ = 315747239472. Its totient is φ = 52899502080.
The previous prime is 132423010207. The next prime is 132423010267. The reversal of 132423010240 is 42010324231.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 28374 + ... + 515413.
It is an arithmetic number, because the mean of its divisors is an integer number (5638343562).
Almost surely, 2132423010240 is an apocalyptic number.
132423010240 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 132423010240, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (157873619736).
132423010240 is an abundant number, since it is smaller than the sum of its proper divisors (183324229232).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132423010240 is an equidigital number, since it uses as much as digits as its factorization.
132423010240 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 544565 (or 544555 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 22.
Adding to 132423010240 its reverse (42010324231), we get a palindrome (174433334471).
The spelling of 132423010240 in words is "one hundred thirty-two billion, four hundred twenty-three million, ten thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.111 sec. • engine limits •