Base | Representation |
---|---|
bin | 111000110001000000… |
… | …0001011101000100111 |
3 | 102122122122120020001010 |
4 | 1301202000023220213 |
5 | 3444124221032421 |
6 | 132000202433303 |
7 | 11543606642256 |
oct | 1614200135047 |
9 | 378578506033 |
10 | 121903299111 |
11 | 477762639a0 |
12 | 1b761202833 |
13 | b659604769 |
14 | 5c8602c79d |
15 | 3287116076 |
hex | 1c6200ba27 |
121903299111 has 64 divisors (see below), whose sum is σ = 181686675456. Its totient is φ = 72084787200.
The previous prime is 121903299061. The next prime is 121903299121. The reversal of 121903299111 is 111992309121.
It is not a de Polignac number, because 121903299111 - 26 = 121903299047 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 121903299111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121903299121) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 142243795 + ... + 142244651.
It is an arithmetic number, because the mean of its divisors is an integer number (2838854304).
Almost surely, 2121903299111 is an apocalyptic number.
121903299111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
121903299111 is a deficient number, since it is larger than the sum of its proper divisors (59783376345).
121903299111 is a wasteful number, since it uses less digits than its factorization.
121903299111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1512.
The product of its (nonzero) digits is 8748, while the sum is 39.
The spelling of 121903299111 in words is "one hundred twenty-one billion, nine hundred three million, two hundred ninety-nine thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •