Base | Representation |
---|---|
bin | 11110010010101000110110… |
… | …100001000000100011011101 |
3 | 122110200220210212222211010012 |
4 | 132102220312201000203131 |
5 | 114430203041303210023 |
6 | 1151201234413253005 |
7 | 40026662363451461 |
oct | 3622506641004335 |
9 | 573626725884105 |
10 | 133222210210013 |
11 | 394a3249627671 |
12 | 12b37434794165 |
13 | 5944a53976852 |
14 | 24c7dbcbd64a1 |
15 | 1060637064978 |
hex | 792a368408dd |
133222210210013 has 24 divisors (see below), whose sum is σ = 147928757906112. Its totient is φ = 119726199926784.
The previous prime is 133222210210007. The next prime is 133222210210043. The reversal of 133222210210013 is 310012012222331.
It is a de Polignac number, because none of the positive numbers 2k-133222210210013 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133222210210043) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 13532495 + ... + 21203132.
It is an arithmetic number, because the mean of its divisors is an integer number (6163698246088).
Almost surely, 2133222210210013 is an apocalyptic number.
It is an amenable number.
133222210210013 is a deficient number, since it is larger than the sum of its proper divisors (14706547696099).
133222210210013 is a wasteful number, since it uses less digits than its factorization.
133222210210013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34736261 (or 34736244 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 133222210210013 its reverse (310012012222331), we get a palindrome (443234222432344).
The spelling of 133222210210013 in words is "one hundred thirty-three trillion, two hundred twenty-two billion, two hundred ten million, two hundred ten thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •