Base | Representation |
---|---|
bin | 1010000000101000111100… |
… | …01001111011001100011001 |
3 | 2212221100100222210210121021 |
4 | 11000110132021323030121 |
5 | 10341122003101411413 |
6 | 114452134324442441 |
7 | 4431221110655266 |
oct | 500243611731431 |
9 | 85840328723537 |
10 | 22012213310233 |
11 | 7017366613643 |
12 | 2576145849421 |
13 | c38986c473a3 |
14 | 56157abb426d |
15 | 2828c51bc18d |
hex | 14051e27b319 |
22012213310233 has 8 divisors (see below), whose sum is σ = 22020815905088. Its totient is φ = 22003612220304.
The previous prime is 22012213310089. The next prime is 22012213310239. The reversal of 22012213310233 is 33201331221022.
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 22012213310233 - 29 = 22012213309721 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 22012213310198 and 22012213310207.
It is not an unprimeable number, because it can be changed into a prime (22012213310239) 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, 29339935 + ... + 30080827.
It is an arithmetic number, because the mean of its divisors is an integer number (2752601988136).
Almost surely, 222012213310233 is an apocalyptic number.
It is an amenable number.
22012213310233 is a deficient number, since it is larger than the sum of its proper divisors (8602594855).
22012213310233 is an equidigital number, since it uses as much as digits as its factorization.
22012213310233 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 752463.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 22012213310233 its reverse (33201331221022), we get a palindrome (55213544531255).
The spelling of 22012213310233 in words is "twenty-two trillion, twelve billion, two hundred thirteen million, three hundred ten thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •