Base | Representation |
---|---|
bin | 110000101000010100… |
… | …0011110011111000101 |
3 | 100222120001020102102110 |
4 | 1201100220132133011 |
5 | 3202334043044023 |
6 | 115550404131233 |
7 | 10354631244042 |
oct | 1412050363705 |
9 | 328501212373 |
10 | 104432003013 |
11 | 40320163608 |
12 | 182a6096b19 |
13 | 9b03a99330 |
14 | 50a990a1c9 |
15 | 2ab3395a93 |
hex | 1850a1e7c5 |
104432003013 has 8 divisors (see below), whose sum is σ = 149953645408. Its totient is φ = 64265847984.
The previous prime is 104432002999. The next prime is 104432003029. The reversal of 104432003013 is 310300234401.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 104432003013 - 25 = 104432002981 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104432003063) 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, 1338871795 + ... + 1338871872.
It is an arithmetic number, because the mean of its divisors is an integer number (18744205676).
Almost surely, 2104432003013 is an apocalyptic number.
104432003013 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
104432003013 is a deficient number, since it is larger than the sum of its proper divisors (45521642395).
104432003013 is a wasteful number, since it uses less digits than its factorization.
104432003013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2677743683.
The product of its (nonzero) digits is 864, while the sum is 21.
Adding to 104432003013 its reverse (310300234401), we get a palindrome (414732237414).
The spelling of 104432003013 in words is "one hundred four billion, four hundred thirty-two million, three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •