Base | Representation |
---|---|
bin | 110000100111110011… |
… | …1101010011001001111 |
3 | 100222111212021012201122 |
4 | 1201033213222121033 |
5 | 3202320220344211 |
6 | 115545000031155 |
7 | 10354333650602 |
oct | 1411747523117 |
9 | 328455235648 |
10 | 104415012431 |
11 | 40311609304 |
12 | 182a04624bb |
13 | 9b003ca932 |
14 | 50a7566339 |
15 | 2ab1b3b6db |
hex | 184f9ea64f |
104415012431 has 8 divisors (see below), whose sum is σ = 107241382320. Its totient is φ = 101588871168.
The previous prime is 104415012397. The next prime is 104415012439. The reversal of 104415012431 is 134210514401.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-104415012431 is a prime.
It is a super-2 number, since 2×1044150124312 (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 104415012431.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104415012439) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1296500 + ... + 1374678.
It is an arithmetic number, because the mean of its divisors is an integer number (13405172790).
Almost surely, 2104415012431 is an apocalyptic number.
104415012431 is a deficient number, since it is larger than the sum of its proper divisors (2826369889).
104415012431 is an equidigital number, since it uses as much as digits as its factorization.
104415012431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 114313.
The product of its (nonzero) digits is 1920, while the sum is 26.
Adding to 104415012431 its reverse (134210514401), we get a palindrome (238625526832).
The spelling of 104415012431 in words is "one hundred four billion, four hundred fifteen million, twelve thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •