Base | Representation |
---|---|
bin | 1001011110101001110011… |
… | …0101110001001101101011 |
3 | 1100220100120120102020102101 |
4 | 2113222130311301031223 |
5 | 2331224202313013003 |
6 | 34055522551514231 |
7 | 2123660243213251 |
oct | 227523465611553 |
9 | 40810516366371 |
10 | 10422222001003 |
11 | 33590486816aa |
12 | 1203a91088977 |
13 | 5a7a71606c87 |
14 | 28061c7405d1 |
15 | 13118c6bd11d |
hex | 97a9cd7136b |
10422222001003 has 4 divisors (see below), whose sum is σ = 10422231000840. Its totient is φ = 10422213001168.
The previous prime is 10422222001001. The next prime is 10422222001027. The reversal of 10422222001003 is 30010022222401.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 10422222001003 - 21 = 10422222001001 is a prime.
It is a super-2 number, since 2×104222220010032 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10422222001001) 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, 2452258 + ... + 5182471.
It is an arithmetic number, because the mean of its divisors is an integer number (2605557750210).
Almost surely, 210422222001003 is an apocalyptic number.
10422222001003 is a deficient number, since it is larger than the sum of its proper divisors (8999837).
10422222001003 is an equidigital number, since it uses as much as digits as its factorization.
10422222001003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8999836.
The product of its (nonzero) digits is 384, while the sum is 19.
Adding to 10422222001003 its reverse (30010022222401), we get a palindrome (40432244223404).
The spelling of 10422222001003 in words is "ten trillion, four hundred twenty-two billion, two hundred twenty-two million, one thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •