Base | Representation |
---|---|
bin | 101111001111001110… |
… | …0000110001101110111 |
3 | 100200211200210112111101 |
4 | 1132132130012031313 |
5 | 3130223224212211 |
6 | 114334010550531 |
7 | 10220560200322 |
oct | 1363634061567 |
9 | 320750715441 |
10 | 101442413431 |
11 | 3a026663717 |
12 | 177b0a38447 |
13 | 97485bb408 |
14 | 4ca48537b9 |
15 | 298abab5c1 |
hex | 179e706377 |
101442413431 has 4 divisors (see below), whose sum is σ = 102446793864. Its totient is φ = 100438033000.
The previous prime is 101442413419. The next prime is 101442413441. The reversal of 101442413431 is 134314244101.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 101442413431 - 29 = 101442412919 is a prime.
It is a super-2 number, since 2×1014424134312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 101442413431.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101442413441) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 502190065 + ... + 502190266.
It is an arithmetic number, because the mean of its divisors is an integer number (25611698466).
Almost surely, 2101442413431 is an apocalyptic number.
101442413431 is a deficient number, since it is larger than the sum of its proper divisors (1004380433).
101442413431 is a wasteful number, since it uses less digits than its factorization.
101442413431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1004380432.
The product of its (nonzero) digits is 4608, while the sum is 28.
Adding to 101442413431 its reverse (134314244101), we get a palindrome (235756657532).
The spelling of 101442413431 in words is "one hundred one billion, four hundred forty-two million, four hundred thirteen thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •