Base | Representation |
---|---|
bin | 11110000000111001011000… |
… | …000011111101110101111010 |
3 | 122022101100211012020021210221 |
4 | 132000321120003331311322 |
5 | 114300214122042410020 |
6 | 1144425201520530254 |
7 | 36542621311343116 |
oct | 3600713003756572 |
9 | 568340735207727 |
10 | 132003002310010 |
11 | 39073182546a57 |
12 | 1297b09648098a |
13 | 5886aa2b2c350 |
14 | 2484d9d696746 |
15 | 103da7ae246aa |
hex | 780e580fdd7a |
132003002310010 has 16 divisors (see below), whose sum is σ = 255882742939656. Its totient is φ = 48739570083648.
The previous prime is 132003002310007. The next prime is 132003002310029. The reversal of 132003002310010 is 10013200300231.
It can be written as a sum of positive squares in 4 ways, for example, as 83827922866081 + 48175079443929 = 9155759^2 + 6940827^2 .
It is a super-2 number, since 2×1320030023100102 (a number of 29 digits) contains 22 as substring.
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, 507703854909 + ... + 507703855168.
Almost surely, 2132003002310010 is an apocalyptic number.
132003002310010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
132003002310010 is a deficient number, since it is larger than the sum of its proper divisors (123879740629646).
132003002310010 is a wasteful number, since it uses less digits than its factorization.
132003002310010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1015407710097.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 132003002310010 its reverse (10013200300231), we get a palindrome (142016202610241).
The spelling of 132003002310010 in words is "one hundred thirty-two trillion, three billion, two million, three hundred ten thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.112 sec. • engine limits •