Base | Representation |
---|---|
bin | 101111001110100100… |
… | …0001101101101000011 |
3 | 100200210011102100200010 |
4 | 1132131020031231003 |
5 | 3130202112032003 |
6 | 114331503400003 |
7 | 10220202244233 |
oct | 1363510155503 |
9 | 320704370603 |
10 | 101420424003 |
11 | 3a015204738 |
12 | 177a55b3003 |
13 | 9743b8c612 |
14 | 4ca196bcc3 |
15 | 2988cb6003 |
hex | 179d20db43 |
101420424003 has 4 divisors (see below), whose sum is σ = 135227232008. Its totient is φ = 67613616000.
The previous prime is 101420423941. The next prime is 101420424041. The reversal of 101420424003 is 300424024101.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 101420424003 - 210 = 101420422979 is a prime.
It is a super-3 number, since 3×1014204240033 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101420444003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 16903403998 + ... + 16903404003.
It is an arithmetic number, because the mean of its divisors is an integer number (33806808002).
Almost surely, 2101420424003 is an apocalyptic number.
101420424003 is a deficient number, since it is larger than the sum of its proper divisors (33806808005).
101420424003 is an equidigital number, since it uses as much as digits as its factorization.
101420424003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33806808004.
The product of its (nonzero) digits is 768, while the sum is 21.
Adding to 101420424003 its reverse (300424024101), we get a palindrome (401844448104).
The spelling of 101420424003 in words is "one hundred one billion, four hundred twenty million, four hundred twenty-four thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •