Base | Representation |
---|---|
bin | 10110101101110000000011… |
… | …101111100101100010010001 |
3 | 111002201102221121022201001201 |
4 | 112231300003233211202101 |
5 | 101043234223020023441 |
6 | 552245515314231201 |
7 | 30020415651026431 |
oct | 2655600357454221 |
9 | 432642847281051 |
10 | 99901002111121 |
11 | 29916860306a92 |
12 | b255597585501 |
13 | 4398816132583 |
14 | 1a9533cccc2c1 |
15 | b839c3531c31 |
hex | 5adc03be5891 |
99901002111121 has 4 divisors (see below), whose sum is σ = 100562598151744. Its totient is φ = 99239406070500.
The previous prime is 99901002111101. The next prime is 99901002111179. The reversal of 99901002111121 is 12111120010999.
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 a cyclic number.
It is not a de Polignac number, because 99901002111121 - 235 = 99866642372753 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (99901002111101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 330798020085 + ... + 330798020386.
It is an arithmetic number, because the mean of its divisors is an integer number (25140649537936).
Almost surely, 299901002111121 is an apocalyptic number.
It is an amenable number.
99901002111121 is a deficient number, since it is larger than the sum of its proper divisors (661596040623).
99901002111121 is a wasteful number, since it uses less digits than its factorization.
99901002111121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 661596040622.
The product of its (nonzero) digits is 2916, while the sum is 37.
The spelling of 99901002111121 in words is "ninety-nine trillion, nine hundred one billion, two million, one hundred eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •