Base | Representation |
---|---|
bin | 10001011110111010010… |
… | …101100111000111011011 |
3 | 11020212002011122102120001 |
4 | 101132322111213013123 |
5 | 124141003024244003 |
6 | 2315531541113431 |
7 | 152541234243643 |
oct | 21367225470733 |
9 | 4225064572501 |
10 | 1201422103003 |
11 | 42357a502131 |
12 | 174a159b8877 |
13 | 893a8104b85 |
14 | 42213351523 |
15 | 213b999961d |
hex | 117ba5671db |
1201422103003 has 8 divisors (see below), whose sum is σ = 1206283921920. Its totient is φ = 1196563435560.
The previous prime is 1201422102977. The next prime is 1201422103019. The reversal of 1201422103003 is 3003012241021.
It is a happy number.
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 1201422103003 - 213 = 1201422094811 is a prime.
It is a super-3 number, since 3×12014221030033 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1201422103303) 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, 22375 + ... + 1550272.
It is an arithmetic number, because the mean of its divisors is an integer number (150785490240).
Almost surely, 21201422103003 is an apocalyptic number.
1201422103003 is a deficient number, since it is larger than the sum of its proper divisors (4861818917).
1201422103003 is a wasteful number, since it uses less digits than its factorization.
1201422103003 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1575737.
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 1201422103003 its reverse (3003012241021), we get a palindrome (4204434344024).
The spelling of 1201422103003 in words is "one trillion, two hundred one billion, four hundred twenty-two million, one hundred three thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •