Base | Representation |
---|---|
bin | 1011110110100101001000… |
… | …1101101111011100110000 |
3 | 1201010212200002200011211020 |
4 | 2331221102031233130300 |
5 | 3202010132342010000 |
6 | 43414543254215440 |
7 | 2513360536116666 |
oct | 275512215573460 |
9 | 51125602604736 |
10 | 13032310110000 |
11 | 4174a7633a645 |
12 | 15658ba354580 |
13 | 736c318252bc |
14 | 330aa51b0c36 |
15 | 179000eccba0 |
hex | bda5236f730 |
13032310110000 has 100 divisors (see below), whose sum is σ = 42070034773272. Its totient is φ = 3475282688000.
The previous prime is 13032310109981. The next prime is 13032310110101. The reversal of 13032310110000 is 1101323031.
It is a tau number, because it is divible by the number of its divisors (100).
It is a super-2 number, since 2×130323101100002 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 217175169 + ... + 217235168.
Almost surely, 213032310110000 is an apocalyptic number.
13032310110000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13032310110000 is an abundant number, since it is smaller than the sum of its proper divisors (29037724663272).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13032310110000 is an equidigital number, since it uses as much as digits as its factorization.
13032310110000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 434410368 (or 434410347 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 15.
Adding to 13032310110000 its reverse (1101323031), we get a palindrome (13033411433031).
The spelling of 13032310110000 in words is "thirteen trillion, thirty-two billion, three hundred ten million, one hundred ten thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •