Base | Representation |
---|---|
bin | 1010000110011111011111… |
… | …10111001010001110010001 |
3 | 2220122120102002002020011211 |
4 | 11003033233313022032101 |
5 | 10402420314311231113 |
6 | 115124352120340121 |
7 | 4451600166334435 |
oct | 503175767121621 |
9 | 86576362066154 |
10 | 22213300102033 |
11 | 7094675898587 |
12 | 25a9105314641 |
13 | c51922471321 |
14 | 56b1b53569c5 |
15 | 287c43c68b3d |
hex | 1433efdca391 |
22213300102033 has 8 divisors (see below), whose sum is σ = 22260822788000. Its totient is φ = 22165789445280.
The previous prime is 22213300101991. The next prime is 22213300102043. The reversal of 22213300102033 is 33020100331222.
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 22213300102033 - 221 = 22213298004881 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 22213300101995 and 22213300102013.
It is not an unprimeable number, because it can be changed into a prime (22213300102043) 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, 694741 + ... + 6701437.
It is an arithmetic number, because the mean of its divisors is an integer number (2782602848500).
Almost surely, 222213300102033 is an apocalyptic number.
It is an amenable number.
22213300102033 is a deficient number, since it is larger than the sum of its proper divisors (47522685967).
22213300102033 is an equidigital number, since it uses as much as digits as its factorization.
22213300102033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6014607.
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 22213300102033 its reverse (33020100331222), we get a palindrome (55233400433255).
The spelling of 22213300102033 in words is "twenty-two trillion, two hundred thirteen billion, three hundred million, one hundred two thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •