Base | Representation |
---|---|
bin | 1011110110101000111001… |
… | …1011010100001010011100 |
3 | 1201010222021111112012122120 |
4 | 2331222032123110022130 |
5 | 3202014214444114322 |
6 | 43415231422142540 |
7 | 2513424553444611 |
oct | 275521633241234 |
9 | 51128244465576 |
10 | 13033320301212 |
11 | 4175444594212 |
12 | 1565b40721a50 |
13 | 737062bc0093 |
14 | 330b5d412508 |
15 | 17905ea23a5c |
hex | bda8e6d429c |
13033320301212 has 48 divisors (see below), whose sum is σ = 30520125603072. Its totient is φ = 4328889617920.
The previous prime is 13033320301187. The next prime is 13033320301229. The reversal of 13033320301212 is 21210302333031.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2102668 + ... + 5521580.
It is an arithmetic number, because the mean of its divisors is an integer number (635835950064).
Almost surely, 213033320301212 is an apocalyptic number.
13033320301212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
13033320301212 is an abundant number, since it is smaller than the sum of its proper divisors (17486805301860).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13033320301212 is a wasteful number, since it uses less digits than its factorization.
13033320301212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3420058 (or 3420056 counting only the distinct ones).
The product of its (nonzero) digits is 1944, while the sum is 24.
Adding to 13033320301212 its reverse (21210302333031), we get a palindrome (34243622634243).
The spelling of 13033320301212 in words is "thirteen trillion, thirty-three billion, three hundred twenty million, three hundred one thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •