Base | Representation |
---|---|
bin | 11111000010100000101… |
… | …101110001101001011101 |
3 | 21112220122110001122122211 |
4 | 133002200231301221131 |
5 | 234421341013230323 |
6 | 4311515311240421 |
7 | 310050505661335 |
oct | 37024055615135 |
9 | 7486573048584 |
10 | 2133000133213 |
11 | 752666a71454 |
12 | 2a5481519111 |
13 | 1261aab68c51 |
14 | 753485980c5 |
15 | 3a73e40e70d |
hex | 1f0a0b71a5d |
2133000133213 has 8 divisors (see below), whose sum is σ = 2244079245240. Its totient is φ = 2024733150720.
The previous prime is 2133000133193. The next prime is 2133000133217. The reversal of 2133000133213 is 3123310003312.
It can be written as a sum of positive squares in 4 ways, for example, as 734109667204 + 1398890466009 = 856802^2 + 1182747^2 .
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 2133000133213 - 217 = 2133000002141 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 (2133000133217) 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, 703030828 + ... + 703033861.
It is an arithmetic number, because the mean of its divisors is an integer number (280509905655).
Almost surely, 22133000133213 is an apocalyptic number.
It is an amenable number.
2133000133213 is a deficient number, since it is larger than the sum of its proper divisors (111079112027).
2133000133213 is a wasteful number, since it uses less digits than its factorization.
2133000133213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1406064767.
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 2133000133213 its reverse (3123310003312), we get a palindrome (5256310136525).
The spelling of 2133000133213 in words is "two trillion, one hundred thirty-three billion, one hundred thirty-three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •