Base | Representation |
---|---|
bin | 101111001011000110… |
… | …1101100111011101001 |
3 | 100200111002010212000010 |
4 | 1132112031230323221 |
5 | 3124432413001441 |
6 | 114312201202133 |
7 | 10214263244310 |
oct | 1362615547351 |
9 | 320432125003 |
10 | 101304422121 |
11 | 39a65783811 |
12 | 17772790349 |
13 | 9725b35456 |
14 | 4c903b3277 |
15 | 297da00116 |
hex | 179636cee9 |
101304422121 has 8 divisors (see below), whose sum is σ = 154368643264. Its totient is φ = 57888241200.
The previous prime is 101304422119. The next prime is 101304422161. The reversal of 101304422121 is 121224403101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 101304422121 - 21 = 101304422119 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21), and also a Moran number because the ratio is a prime number: 4824020101 = 101304422121 / (1 + 0 + 1 + 3 + 0 + 4 + 4 + 2 + 2 + 1 + 2 + 1).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101304422111) 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, 2412010030 + ... + 2412010071.
It is an arithmetic number, because the mean of its divisors is an integer number (19296080408).
Almost surely, 2101304422121 is an apocalyptic number.
It is an amenable number.
101304422121 is a deficient number, since it is larger than the sum of its proper divisors (53064221143).
101304422121 is an equidigital number, since it uses as much as digits as its factorization.
101304422121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4824020111.
The product of its (nonzero) digits is 384, while the sum is 21.
Adding to 101304422121 its reverse (121224403101), we get a palindrome (222528825222).
The spelling of 101304422121 in words is "one hundred one billion, three hundred four million, four hundred twenty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •