Base | Representation |
---|---|
bin | 101111000101111011… |
… | …0101101110110110001 |
3 | 100200000222010000101201 |
4 | 1132023312231312301 |
5 | 3124103414440213 |
6 | 114243032131201 |
7 | 10210053060436 |
oct | 1361366556661 |
9 | 320028100351 |
10 | 101130624433 |
11 | 39986667a63 |
12 | 17724536b01 |
13 | 96c8b23697 |
14 | 4c75291b8d |
15 | 296d61e6dd |
hex | 178bdaddb1 |
101130624433 has 4 divisors (see below), whose sum is σ = 105527608128. Its totient is φ = 96733640740.
The previous prime is 101130624421. The next prime is 101130624443. The reversal of 101130624433 is 334426031101.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 101130624433 - 217 = 101130493361 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101130624443) 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 3 ways as a sum of consecutive naturals, for example, 2198491813 + ... + 2198491858.
It is an arithmetic number, because the mean of its divisors is an integer number (26381902032).
Almost surely, 2101130624433 is an apocalyptic number.
It is an amenable number.
101130624433 is a deficient number, since it is larger than the sum of its proper divisors (4396983695).
101130624433 is an equidigital number, since it uses as much as digits as its factorization.
101130624433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4396983694.
The product of its (nonzero) digits is 5184, while the sum is 28.
Adding to 101130624433 its reverse (334426031101), we get a palindrome (435556655534).
The spelling of 101130624433 in words is "one hundred one billion, one hundred thirty million, six hundred twenty-four thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •