Base | Representation |
---|---|
bin | 11110000111000000100011… |
… | …010001000000011011000010 |
3 | 122100212111222011212220110001 |
4 | 132013000203101000123002 |
5 | 114324104322433043020 |
6 | 1145350144101030214 |
7 | 36615150652201546 |
oct | 3607004321003302 |
9 | 570774864786401 |
10 | 132423023331010 |
11 | 3921531a4557a5 |
12 | 12a285766b536a |
13 | 58b758c2c5379 |
14 | 249b446853a26 |
15 | 104996033c50a |
hex | 7870234406c2 |
132423023331010 has 32 divisors (see below), whose sum is σ = 238699631362752. Its totient is φ = 52894104943680.
The previous prime is 132423023330963. The next prime is 132423023331017. The reversal of 132423023331010 is 10133320324231.
It is a self number, because there is not a number n which added to its sum of digits gives 132423023331010.
It is not an unprimeable number, because it can be changed into a prime (132423023331017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 18669205 + ... + 24766615.
It is an arithmetic number, because the mean of its divisors is an integer number (7459363480086).
Almost surely, 2132423023331010 is an apocalyptic number.
132423023331010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
132423023331010 is a deficient number, since it is larger than the sum of its proper divisors (106276608031742).
132423023331010 is a wasteful number, since it uses less digits than its factorization.
132423023331010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6100498.
The product of its (nonzero) digits is 7776, while the sum is 28.
Adding to 132423023331010 its reverse (10133320324231), we get a palindrome (142556343655241).
The spelling of 132423023331010 in words is "one hundred thirty-two trillion, four hundred twenty-three billion, twenty-three million, three hundred thirty-one thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •