Base | Representation |
---|---|
bin | 101111001110010000… |
… | …1010111011011011111 |
3 | 100200202110020222011002 |
4 | 1132130201113123133 |
5 | 3130142010141343 |
6 | 114330501220515 |
7 | 10220016551015 |
oct | 1363441273337 |
9 | 320673228132 |
10 | 101410240223 |
11 | 3a00a489496 |
12 | 177a210173b |
13 | 9741a35206 |
14 | 4ca047a8b5 |
15 | 2987e538b8 |
hex | 179c8576df |
101410240223 has 8 divisors (see below), whose sum is σ = 101589443136. Its totient is φ = 101231104000.
The previous prime is 101410240193. The next prime is 101410240231. The reversal of 101410240223 is 322042014101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 101410240223 - 210 = 101410239199 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101410240195 and 101410240204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101410240523) 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 7 ways as a sum of consecutive naturals, for example, 3770423 + ... + 3797223.
It is an arithmetic number, because the mean of its divisors is an integer number (12698680392).
Almost surely, 2101410240223 is an apocalyptic number.
101410240223 is a deficient number, since it is larger than the sum of its proper divisors (179202913).
101410240223 is an equidigital number, since it uses as much as digits as its factorization.
101410240223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33345.
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 101410240223 its reverse (322042014101), we get a palindrome (423452254324).
The spelling of 101410240223 in words is "one hundred one billion, four hundred ten million, two hundred forty thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •