Base | Representation |
---|---|
bin | 110000011101000011… |
… | …1101010001100001101 |
3 | 100221120201112012021210 |
4 | 1200322013222030031 |
5 | 3201100400121303 |
6 | 115445112445033 |
7 | 10342363653234 |
oct | 1407207521415 |
9 | 327521465253 |
10 | 104054301453 |
11 | 40146a38863 |
12 | 181bb6a9779 |
13 | 9a7376439b |
14 | 50716abb1b |
15 | 2a90139203 |
hex | 183a1ea30d |
104054301453 has 16 divisors (see below), whose sum is σ = 138952622016. Its totient is φ = 69262824960.
The previous prime is 104054301443. The next prime is 104054301457. The reversal of 104054301453 is 354103450401.
It is not a de Polignac number, because 104054301453 - 26 = 104054301389 is a prime.
It is a super-2 number, since 2×1040543014532 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 104054301453.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104054301457) 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 15 ways as a sum of consecutive naturals, for example, 8049151 + ... + 8062067.
It is an arithmetic number, because the mean of its divisors is an integer number (8684538876).
Almost surely, 2104054301453 is an apocalyptic number.
It is an amenable number.
104054301453 is a deficient number, since it is larger than the sum of its proper divisors (34898320563).
104054301453 is a wasteful number, since it uses less digits than its factorization.
104054301453 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16844.
The product of its (nonzero) digits is 14400, while the sum is 30.
Adding to 104054301453 its reverse (354103450401), we get a palindrome (458157751854).
The spelling of 104054301453 in words is "one hundred four billion, fifty-four million, three hundred one thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •