Base | Representation |
---|---|
bin | 1011000111010011000101… |
… | …0111100100100111111111 |
3 | 1121021012222112010021210021 |
4 | 2301310301113210213333 |
5 | 3100203040104020111 |
6 | 41553443432353011 |
7 | 2400603150020305 |
oct | 261646127444777 |
9 | 47235875107707 |
10 | 12220010220031 |
11 | 3991528215529 |
12 | 14543a0845767 |
13 | 6a845a554433 |
14 | 303647486275 |
15 | 162d0ce7dd71 |
hex | b1d315e49ff |
12220010220031 has 2 divisors, whose sum is σ = 12220010220032. Its totient is φ = 12220010220030.
The previous prime is 12220010220029. The next prime is 12220010220073. The reversal of 12220010220031 is 13002201002221.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 12220010220031 - 21 = 12220010220029 is a prime.
It is a super-2 number, since 2×122200102200312 (a number of 27 digits) contains 22 as substring.
Together with 12220010220029, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 12220010219987 and 12220010220014.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12220010220731) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6110005110015 + 6110005110016.
It is an arithmetic number, because the mean of its divisors is an integer number (6110005110016).
Almost surely, 212220010220031 is an apocalyptic number.
12220010220031 is a deficient number, since it is larger than the sum of its proper divisors (1).
12220010220031 is an equidigital number, since it uses as much as digits as its factorization.
12220010220031 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 96, while the sum is 16.
Adding to 12220010220031 its reverse (13002201002221), we get a palindrome (25222211222252).
The spelling of 12220010220031 in words is "twelve trillion, two hundred twenty billion, ten million, two hundred twenty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •