Base | Representation |
---|---|
bin | 101110100111010001… |
… | …0110101100110110001 |
3 | 100120101021120122020002 |
4 | 1131032202311212301 |
5 | 3120002103044441 |
6 | 113553005155345 |
7 | 10142422662461 |
oct | 1351642654661 |
9 | 316337518202 |
10 | 100102003121 |
11 | 394a8a755aa |
12 | 17497b5bb55 |
13 | 95939a4c13 |
14 | 4bb8813ba1 |
15 | 290d187b9b |
hex | 174e8b59b1 |
100102003121 has 4 divisors (see below), whose sum is σ = 100655053044. Its totient is φ = 99548953200.
The previous prime is 100102003097. The next prime is 100102003129. The reversal of 100102003121 is 121300201001.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 3517794721 + 96584208400 = 59311^2 + 310780^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-100102003121 is a prime.
It is a super-2 number, since 2×1001020031212 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (100102003129) 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, 276524690 + ... + 276525051.
It is an arithmetic number, because the mean of its divisors is an integer number (25163763261).
Almost surely, 2100102003121 is an apocalyptic number.
It is an amenable number.
100102003121 is a deficient number, since it is larger than the sum of its proper divisors (553049923).
100102003121 is an equidigital number, since it uses as much as digits as its factorization.
100102003121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 553049922.
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 100102003121 its reverse (121300201001), we get a palindrome (221402204122).
The spelling of 100102003121 in words is "one hundred billion, one hundred two million, three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •