Base | Representation |
---|---|
bin | 101011110101010101101… |
… | …101010010100000010101 |
3 | 101122222001002120001112122 |
4 | 223311111231102200111 |
5 | 343323001230311013 |
6 | 10223442402225325 |
7 | 430424241426212 |
oct | 53652555224025 |
9 | 11588032501478 |
10 | 3012210010133 |
11 | a61520028045 |
12 | 407953055245 |
13 | 18b08634507c |
14 | a5b12780b09 |
15 | 5354b649a08 |
hex | 2bd55b52815 |
3012210010133 has 8 divisors (see below), whose sum is σ = 3133113789696. Its totient is φ = 2892789712800.
The previous prime is 3012210010021. The next prime is 3012210010157. The reversal of 3012210010133 is 3310100122103.
3012210010133 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 3012210010133 - 226 = 3012142901269 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3012210010633) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 370866416 + ... + 370874537.
It is an arithmetic number, because the mean of its divisors is an integer number (391639223712).
Almost surely, 23012210010133 is an apocalyptic number.
It is an amenable number.
3012210010133 is a deficient number, since it is larger than the sum of its proper divisors (120903779563).
3012210010133 is a wasteful number, since it uses less digits than its factorization.
3012210010133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 741741115.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 3012210010133 its reverse (3310100122103), we get a palindrome (6322310132236).
The spelling of 3012210010133 in words is "three trillion, twelve billion, two hundred ten million, ten thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •