Base | Representation |
---|---|
bin | 10111101010000011100011… |
… | …110111100100011010110111 |
3 | 111122101121121122212221212012 |
4 | 113222003203313210122313 |
5 | 102114133341324222211 |
6 | 1005141355233114435 |
7 | 30626003560326302 |
oct | 2752034367443267 |
9 | 448347548787765 |
10 | 104045110773431 |
11 | 30174313643583 |
12 | b8047810b8a1b |
13 | 4609547a98c09 |
14 | 1b99b4b3b7b39 |
15 | c066bac99d8b |
hex | 5ea0e3de46b7 |
104045110773431 has 8 divisors (see below), whose sum is σ = 107923185947280. Its totient is φ = 100233327483072.
The previous prime is 104045110773389. The next prime is 104045110773437. The reversal of 104045110773431 is 134377011540401.
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 a de Polignac number, because none of the positive numbers 2k-104045110773431 is a prime.
It is a super-2 number, since 2×1040451107734312 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104045110773437) 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, 16572967676 + ... + 16572973953.
It is an arithmetic number, because the mean of its divisors is an integer number (13490398243410).
Almost surely, 2104045110773431 is an apocalyptic number.
104045110773431 is a deficient number, since it is larger than the sum of its proper divisors (3878075173849).
104045110773431 is an equidigital number, since it uses as much as digits as its factorization.
104045110773431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33145941745.
The product of its (nonzero) digits is 141120, while the sum is 41.
The spelling of 104045110773431 in words is "one hundred four trillion, forty-five billion, one hundred ten million, seven hundred seventy-three thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •