Base | Representation |
---|---|
bin | 101110100111111000… |
… | …0010001101010010001 |
3 | 100120102200202222120221 |
4 | 1131033300101222101 |
5 | 3120022302144441 |
6 | 113555012233041 |
7 | 10143060351241 |
oct | 1351760215221 |
9 | 316380688527 |
10 | 100122303121 |
11 | 39509480265 |
12 | 174a290b781 |
13 | 9597c61a59 |
14 | 4bbb3b9b21 |
15 | 290ed478d1 |
hex | 174fc11a91 |
100122303121 has 8 divisors (see below), whose sum is σ = 100875790400. Its totient is φ = 99369290160.
The previous prime is 100122303107. The next prime is 100122303161. The reversal of 100122303121 is 121303221001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-100122303121 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100122303095 and 100122303104.
It is not an unprimeable number, because it can be changed into a prime (100122303101) 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, 311011 + ... + 544951.
It is an arithmetic number, because the mean of its divisors is an integer number (12609473800).
Almost surely, 2100122303121 is an apocalyptic number.
It is an amenable number.
100122303121 is a deficient number, since it is larger than the sum of its proper divisors (753487279).
100122303121 is a wasteful number, since it uses less digits than its factorization.
100122303121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 237159.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 100122303121 its reverse (121303221001), we get a palindrome (221425524122).
It can be divided in two parts, 100 and 122303121, that added together give a palindrome (122303221).
The spelling of 100122303121 in words is "one hundred billion, one hundred twenty-two million, three hundred three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •