Base | Representation |
---|---|
bin | 1011111100011101011001… |
… | …0001110101010111001000 |
3 | 1201111112100221211100222220 |
4 | 2333013112101311113020 |
5 | 3210134004331214422 |
6 | 43533205341014040 |
7 | 2523564444165036 |
oct | 277072621652710 |
9 | 51445327740886 |
10 | 13133310023112 |
11 | 420389513a214 |
12 | 15813a6b54320 |
13 | 7436095414b6 |
14 | 335926d59556 |
15 | 17b962dcce5c |
hex | bf1d64755c8 |
13133310023112 has 64 divisors (see below), whose sum is σ = 33411332520000. Its totient is φ = 4300791508224.
The previous prime is 13133310023111. The next prime is 13133310023173. The reversal of 13133310023112 is 21132001333131.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is not an unprimeable number, because it can be changed into a prime (13133310023111) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 800463 + ... + 5187230.
It is an arithmetic number, because the mean of its divisors is an integer number (522052070625).
Almost surely, 213133310023112 is an apocalyptic number.
13133310023112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
13133310023112 is an abundant number, since it is smaller than the sum of its proper divisors (20278022496888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13133310023112 is a wasteful number, since it uses less digits than its factorization.
13133310023112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5989310 (or 5989306 counting only the distinct ones).
The product of its (nonzero) digits is 972, while the sum is 24.
Adding to 13133310023112 its reverse (21132001333131), we get a palindrome (34265311356243).
The spelling of 13133310023112 in words is "thirteen trillion, one hundred thirty-three billion, three hundred ten million, twenty-three thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •