Base | Representation |
---|---|
bin | 1001010011000001011011… |
… | …0001111001100110001001 |
3 | 1100012020210221020112202202 |
4 | 2110300112301321212021 |
5 | 2314440441003003301 |
6 | 33424035134005545 |
7 | 2103354465154130 |
oct | 224602661714611 |
9 | 40166727215682 |
10 | 10222404344201 |
11 | 329132a833665 |
12 | 11912066468b5 |
13 | 591c78ccc3aa |
14 | 274aa4966917 |
15 | 12ad9526666b |
hex | 94c16c79989 |
10222404344201 has 4 divisors (see below), whose sum is σ = 11682747821952. Its totient is φ = 8762060866452.
The previous prime is 10222404344171. The next prime is 10222404344213. The reversal of 10222404344201 is 10244340422201.
It is a happy number.
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 10222404344201 - 238 = 9947526437257 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10222404344291) 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, 730171738865 + ... + 730171738878.
It is an arithmetic number, because the mean of its divisors is an integer number (2920686955488).
Almost surely, 210222404344201 is an apocalyptic number.
It is an amenable number.
10222404344201 is a deficient number, since it is larger than the sum of its proper divisors (1460343477751).
10222404344201 is an equidigital number, since it uses as much as digits as its factorization.
10222404344201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1460343477750.
The product of its (nonzero) digits is 12288, while the sum is 29.
Adding to 10222404344201 its reverse (10244340422201), we get a palindrome (20466744766402).
The spelling of 10222404344201 in words is "ten trillion, two hundred twenty-two billion, four hundred four million, three hundred forty-four thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •