Base | Representation |
---|---|
bin | 110001000010100011… |
… | …1000011101100111001 |
3 | 101001211101221000001121 |
4 | 1202011013003230321 |
5 | 3211134440410001 |
6 | 120214014545241 |
7 | 10415511633124 |
oct | 1420507035471 |
9 | 331741830047 |
10 | 105312435001 |
11 | 40732140154 |
12 | 184b0b08221 |
13 | 9c143010c7 |
14 | 51508113bb |
15 | 2b158096a1 |
hex | 18851c3b39 |
105312435001 has 8 divisors (see below), whose sum is σ = 105541380000. Its totient is φ = 105083549760.
The previous prime is 105312434993. The next prime is 105312435083. The reversal of 105312435001 is 100534213501.
It is a happy number.
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 105312435001 - 23 = 105312434993 is a prime.
It is a super-2 number, since 2×1053124350012 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (105312435101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6620065 + ... + 6635953.
It is an arithmetic number, because the mean of its divisors is an integer number (13192672500).
Almost surely, 2105312435001 is an apocalyptic number.
It is an amenable number.
105312435001 is a deficient number, since it is larger than the sum of its proper divisors (228944999).
105312435001 is a wasteful number, since it uses less digits than its factorization.
105312435001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29879.
The product of its (nonzero) digits is 1800, while the sum is 25.
Adding to 105312435001 its reverse (100534213501), we get a palindrome (205846648502).
The spelling of 105312435001 in words is "one hundred five billion, three hundred twelve million, four hundred thirty-five thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •