Base | Representation |
---|---|
bin | 11011100011111111000001… |
… | …001011011101010010010001 |
3 | 120220012112021101211102022010 |
4 | 123203333001023131102101 |
5 | 111342032232332014413 |
6 | 1105451425130333133 |
7 | 34350602104446225 |
oct | 3343770113352221 |
9 | 526175241742263 |
10 | 121220103001233 |
11 | 3569617aa40705 |
12 | 1171932728a1a9 |
13 | 5284011843b82 |
14 | 21d1127412785 |
15 | e0332e155dc3 |
hex | 6e3fc12dd491 |
121220103001233 has 4 divisors (see below), whose sum is σ = 161626804001648. Its totient is φ = 80813402000820.
The previous prime is 121220103001201. The next prime is 121220103001267. The reversal of 121220103001233 is 332100301022121.
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 not a de Polignac number, because 121220103001233 - 25 = 121220103001201 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (121220103000233) 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, 20203350500203 + ... + 20203350500208.
It is an arithmetic number, because the mean of its divisors is an integer number (40406701000412).
Almost surely, 2121220103001233 is an apocalyptic number.
It is an amenable number.
121220103001233 is a deficient number, since it is larger than the sum of its proper divisors (40406701000415).
121220103001233 is an equidigital number, since it uses as much as digits as its factorization.
121220103001233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40406701000414.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 121220103001233 its reverse (332100301022121), we get a palindrome (453320404023354).
The spelling of 121220103001233 in words is "one hundred twenty-one trillion, two hundred twenty billion, one hundred three million, one thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •