Base | Representation |
---|---|
bin | 111000010110110001… |
… | …0100010011111110001 |
3 | 102120101022100010221222 |
4 | 1300231202202133301 |
5 | 3440323404110301 |
6 | 131333001154425 |
7 | 11513031326504 |
oct | 1605542423761 |
9 | 376338303858 |
10 | 121023113201 |
11 | 47364435221 |
12 | 1b55648ba15 |
13 | b5491579b3 |
14 | 5c0118d13b |
15 | 3234c0031b |
hex | 1c2d8a27f1 |
121023113201 has 8 divisors (see below), whose sum is σ = 126586393920. Its totient is φ = 115484949712.
The previous prime is 121023113179. The next prime is 121023113269. The reversal of 121023113201 is 102311320121.
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 121023113201 - 26 = 121023113137 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 121023113201.
It is not an unprimeable number, because it can be changed into a prime (121023112201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6269450 + ... + 6288723.
It is an arithmetic number, because the mean of its divisors is an integer number (15823299240).
Almost surely, 2121023113201 is an apocalyptic number.
It is an amenable number.
121023113201 is a deficient number, since it is larger than the sum of its proper divisors (5563280719).
121023113201 is a wasteful number, since it uses less digits than its factorization.
121023113201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12558615.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 121023113201 its reverse (102311320121), we get a palindrome (223334433322).
The spelling of 121023113201 in words is "one hundred twenty-one billion, twenty-three million, one hundred thirteen thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •