Base | Representation |
---|---|
bin | 101011110101001001010… |
… | …000110100011000100101 |
3 | 101122221111112200102111200 |
4 | 223311021100310120211 |
5 | 343322034303021013 |
6 | 10223405543153113 |
7 | 430416124642053 |
oct | 53651120643045 |
9 | 11587445612450 |
10 | 3012001220133 |
11 | a61423191024 |
12 | 4078b5145799 |
13 | 18b052000ba9 |
14 | a5ad2b511d3 |
15 | 53538155e73 |
hex | 2bd49434625 |
3012001220133 has 12 divisors (see below), whose sum is σ = 4579650978240. Its totient is φ = 1902316559976.
The previous prime is 3012001220119. The next prime is 3012001220143. The reversal of 3012001220133 is 3310221002103.
3012001220133 is a `hidden beast` number, since 301 + 200 + 12 + 20 + 133 = 666.
It is not a de Polignac number, because 3012001220133 - 233 = 3003411285541 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3012001220143) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 8807020941 + ... + 8807021282.
It is an arithmetic number, because the mean of its divisors is an integer number (381637581520).
Almost surely, 23012001220133 is an apocalyptic number.
It is an amenable number.
3012001220133 is a deficient number, since it is larger than the sum of its proper divisors (1567649758107).
3012001220133 is a wasteful number, since it uses less digits than its factorization.
3012001220133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17614042248 (or 17614042245 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 3012001220133 its reverse (3310221002103), we get a palindrome (6322222222236).
The spelling of 3012001220133 in words is "three trillion, twelve billion, one million, two hundred twenty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •