Base | Representation |
---|---|
bin | 11011100001000110100111… |
… | …111000001011100101110011 |
3 | 120212111121012221002221201022 |
4 | 123201012213320023211303 |
5 | 111330311240131201003 |
6 | 1105220442333530055 |
7 | 34330362464054561 |
oct | 3341064770134563 |
9 | 525447187087638 |
10 | 121022110022003 |
11 | 3561a209081963 |
12 | 116a6a8b94392b |
13 | 526b44a289868 |
14 | 21c5703ad6a31 |
15 | ded0e1ece738 |
hex | 6e11a7e0b973 |
121022110022003 has 4 divisors (see below), whose sum is σ = 123305546060208. Its totient is φ = 118738673983800.
The previous prime is 121022110021919. The next prime is 121022110022041. The reversal of 121022110022003 is 300220011220121.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 121022110022003 - 222 = 121022105827699 is a prime.
It is a super-2 number, since 2×1210221100220032 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (121022110028003) 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, 1141718019023 + ... + 1141718019128.
It is an arithmetic number, because the mean of its divisors is an integer number (30826386515052).
Almost surely, 2121022110022003 is an apocalyptic number.
121022110022003 is a deficient number, since it is larger than the sum of its proper divisors (2283436038205).
121022110022003 is an equidigital number, since it uses as much as digits as its factorization.
121022110022003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2283436038204.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 121022110022003 its reverse (300220011220121), we get a palindrome (421242121242124).
The spelling of 121022110022003 in words is "one hundred twenty-one trillion, twenty-two billion, one hundred ten million, twenty-two thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •