Base | Representation |
---|---|
bin | 1011111010101000110111… |
… | …1001111101001010101000 |
3 | 1201101112122001220001000122 |
4 | 2332222031321331022220 |
5 | 3204130424421024000 |
6 | 43510553455422412 |
7 | 2521406354152040 |
oct | 276521571751250 |
9 | 51345561801018 |
10 | 13102031033000 |
11 | 41a15a3a48a68 |
12 | 1577317824a08 |
13 | 7406931b9420 |
14 | 3341daadc720 |
15 | 17ac31d64085 |
hex | bea8de7d2a8 |
13102031033000 has 128 divisors (see below), whose sum is σ = 37733849637120. Its totient is φ = 4146576825600.
The previous prime is 13102031032931. The next prime is 13102031033009. The reversal of 13102031033000 is 33013020131.
It is a self number, because there is not a number n which added to its sum of digits gives 13102031033000.
It is not an unprimeable number, because it can be changed into a prime (13102031033009) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 71898182 + ... + 72080181.
It is an arithmetic number, because the mean of its divisors is an integer number (294795700290).
Almost surely, 213102031033000 is an apocalyptic number.
13102031033000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13102031033000 is an abundant number, since it is smaller than the sum of its proper divisors (24631818604120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13102031033000 is a wasteful number, since it uses less digits than its factorization.
13102031033000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 143978404 (or 143978390 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 17.
Adding to 13102031033000 its reverse (33013020131), we get a palindrome (13135044053131).
The spelling of 13102031033000 in words is "thirteen trillion, one hundred two billion, thirty-one million, thirty-three thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •