Base | Representation |
---|---|
bin | 110000101000111001… |
… | …0010010100111000111 |
3 | 100222121101122111122210 |
4 | 1201101302102213013 |
5 | 3202404021244111 |
6 | 115552334554503 |
7 | 10355254565064 |
oct | 1412162224707 |
9 | 328541574583 |
10 | 104451353031 |
11 | 4033007a563 |
12 | 182b0668a33 |
13 | 9b07ab294c |
14 | 50ac305c6b |
15 | 2ab4e190a6 |
hex | 1851c929c7 |
104451353031 has 4 divisors (see below), whose sum is σ = 139268470712. Its totient is φ = 69634235352.
The previous prime is 104451353021. The next prime is 104451353047. The reversal of 104451353031 is 130353154401.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 104451353031 - 215 = 104451320263 is a prime.
It is a super-2 number, since 2×1044513530312 (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 104451353031.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104451353021) 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 3 ways as a sum of consecutive naturals, for example, 17408558836 + ... + 17408558841.
It is an arithmetic number, because the mean of its divisors is an integer number (34817117678).
Almost surely, 2104451353031 is an apocalyptic number.
104451353031 is a deficient number, since it is larger than the sum of its proper divisors (34817117681).
104451353031 is an equidigital number, since it uses as much as digits as its factorization.
104451353031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34817117680.
The product of its (nonzero) digits is 10800, while the sum is 30.
The spelling of 104451353031 in words is "one hundred four billion, four hundred fifty-one million, three hundred fifty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •