Base | Representation |
---|---|
bin | 1011110110100111110100… |
… | …1111101001101101111100 |
3 | 1201010221112102002120101202 |
4 | 2331221331033221231330 |
5 | 3202013122144443400 |
6 | 43415143043355032 |
7 | 2513414453261144 |
oct | 275517517515574 |
9 | 51127472076352 |
10 | 13033032031100 |
11 | 41753068a1654 |
12 | 1565a80082a78 |
13 | 73701826b353 |
14 | 330b33013924 |
15 | 1790445804d5 |
hex | bda7d3e9b7c |
13033032031100 has 72 divisors (see below), whose sum is σ = 29483041881216. Its totient is φ = 4995093600000.
The previous prime is 13033032031081. The next prime is 13033032031109. The reversal of 13033032031100 is 113023033031.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13033032031109) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 20499791 + ... + 21125990.
Almost surely, 213033032031100 is an apocalyptic number.
13033032031100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13033032031100 is an abundant number, since it is smaller than the sum of its proper divisors (16450009850116).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13033032031100 is a wasteful number, since it uses less digits than its factorization.
13033032031100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41625927 (or 41625920 counting only the distinct ones).
The product of its (nonzero) digits is 486, while the sum is 20.
Adding to 13033032031100 its reverse (113023033031), we get a palindrome (13146055064131).
The spelling of 13033032031100 in words is "thirteen trillion, thirty-three billion, thirty-two million, thirty-one thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.204 sec. • engine limits •