Base | Representation |
---|---|
bin | 111000010110111110… |
… | …0110110010011111111 |
3 | 102120101210022112202002 |
4 | 1300231330312103333 |
5 | 3440332140310421 |
6 | 131333405052515 |
7 | 11513144053223 |
oct | 1605574662377 |
9 | 376353275662 |
10 | 121030010111 |
11 | 47368315a4a |
12 | 1b55885713b |
13 | b54a700cca |
14 | 5c02066783 |
15 | 3235613b0b |
hex | 1c2df364ff |
121030010111 has 8 divisors (see below), whose sum is σ = 122439345840. Its totient is φ = 119623972608.
The previous prime is 121030010107. The next prime is 121030010113. The reversal of 121030010111 is 111010030121.
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 121030010111 - 22 = 121030010107 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 121030010092 and 121030010101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121030010113) 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, 750701 + ... + 897558.
It is an arithmetic number, because the mean of its divisors is an integer number (15304918230).
Almost surely, 2121030010111 is an apocalyptic number.
121030010111 is a deficient number, since it is larger than the sum of its proper divisors (1409335729).
121030010111 is an equidigital number, since it uses as much as digits as its factorization.
121030010111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1649113.
The product of its (nonzero) digits is 6, while the sum is 11.
Adding to 121030010111 its reverse (111010030121), we get a palindrome (232040040232).
It can be divided in two parts, 121030010 and 111, that added together give a palindrome (121030121).
The spelling of 121030010111 in words is "one hundred twenty-one billion, thirty million, ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •