Base | Representation |
---|---|
bin | 101111100010110100… |
… | …1000011011000100001 |
3 | 100202112112101112211110 |
4 | 1133011221003120201 |
5 | 3133100112333441 |
6 | 114523143533533 |
7 | 10243064465415 |
oct | 1370551033041 |
9 | 322475345743 |
10 | 102100121121 |
11 | 3a333947199 |
12 | 1795515a2a9 |
13 | 982194076b |
14 | 4d27d3cd45 |
15 | 29c87c7b16 |
hex | 17c5a43621 |
102100121121 has 8 divisors (see below), whose sum is σ = 139812778624. Its totient is φ = 66227105520.
The previous prime is 102100121119. The next prime is 102100121209. The reversal of 102100121121 is 121121001201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 102100121121 - 21 = 102100121119 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 102100121097 and 102100121106.
It is not an unprimeable number, because it can be changed into a prime (102100121521) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 459910345 + ... + 459910566.
It is an arithmetic number, because the mean of its divisors is an integer number (17476597328).
Almost surely, 2102100121121 is an apocalyptic number.
It is an amenable number.
102100121121 is a deficient number, since it is larger than the sum of its proper divisors (37712657503).
102100121121 is an equidigital number, since it uses as much as digits as its factorization.
102100121121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 919820951.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 102100121121 its reverse (121121001201), we get a palindrome (223221122322).
The spelling of 102100121121 in words is "one hundred two billion, one hundred million, one hundred twenty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •