Base | Representation |
---|---|
bin | 11101011011011011000… |
… | …101001110100111011101 |
3 | 21011022221021102221120122 |
4 | 131123123011032213131 |
5 | 231113142403210023 |
6 | 4145011514124325 |
7 | 266051506106102 |
oct | 35333305164735 |
9 | 7138837387518 |
10 | 2022310210013 |
11 | 70a725434885 |
12 | 287b2b7206a5 |
13 | 11891a74a482 |
14 | 6dc47900aa9 |
15 | 379119852c8 |
hex | 1d6db14e9dd |
2022310210013 has 4 divisors (see below), whose sum is σ = 2022315808128. Its totient is φ = 2022304611900.
The previous prime is 2022310210009. The next prime is 2022310210051. The reversal of 2022310210013 is 3100120132202.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 2022310210013 - 22 = 2022310210009 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2022310209973 and 2022310210000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2022310260013) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2216813 + ... + 2993138.
It is an arithmetic number, because the mean of its divisors is an integer number (505578952032).
Almost surely, 22022310210013 is an apocalyptic number.
It is an amenable number.
2022310210013 is a deficient number, since it is larger than the sum of its proper divisors (5598115).
2022310210013 is an equidigital number, since it uses as much as digits as its factorization.
2022310210013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5598114.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 2022310210013 its reverse (3100120132202), we get a palindrome (5122430342215).
The spelling of 2022310210013 in words is "two trillion, twenty-two billion, three hundred ten million, two hundred ten thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •