Base | Representation |
---|---|
bin | 111000011100101100… |
… | …1010001100001111001 |
3 | 102120220011121012110011 |
4 | 1300321121101201321 |
5 | 3441230313323001 |
6 | 131404424221521 |
7 | 11520665043460 |
oct | 1607131214171 |
9 | 376804535404 |
10 | 121222011001 |
11 | 47456735073 |
12 | 1b5b100a8a1 |
13 | b57b4173c0 |
14 | 5c1d7659d7 |
15 | 32473dcd51 |
hex | 1c39651879 |
121222011001 has 8 divisors (see below), whose sum is σ = 149196321344. Its totient is φ = 95911920720.
The previous prime is 121222010983. The next prime is 121222011011. The reversal of 121222011001 is 100110222121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 121222011001 - 27 = 121222010873 is a prime.
It is a super-2 number, since 2×1212220110012 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is not an unprimeable number, because it can be changed into a prime (121222011011) 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, 666054915 + ... + 666055096.
It is an arithmetic number, because the mean of its divisors is an integer number (18649540168).
Almost surely, 2121222011001 is an apocalyptic number.
It is an amenable number.
121222011001 is a deficient number, since it is larger than the sum of its proper divisors (27974310343).
121222011001 is a wasteful number, since it uses less digits than its factorization.
121222011001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1332110031.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 121222011001 its reverse (100110222121), we get a palindrome (221332233122).
It can be divided in two parts, 1212220 and 11001, that added together give a palindrome (1223221).
The spelling of 121222011001 in words is "one hundred twenty-one billion, two hundred twenty-two million, eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •