Base | Representation |
---|---|
bin | 10111110000000001100101… |
… | …111100100001000001101110 |
3 | 111200211211102111111211011020 |
4 | 113300001211330201001232 |
5 | 102142343441120021304 |
6 | 1010054035333235010 |
7 | 31000435036616244 |
oct | 2760014574410156 |
9 | 450754374454136 |
10 | 104455315001454 |
11 | 303122831a047a |
12 | b870181792a66 |
13 | 463912b4cc2b1 |
14 | 1bb19428a2794 |
15 | c121c84435d9 |
hex | 5f0065f2106e |
104455315001454 has 8 divisors (see below), whose sum is σ = 208910630002920. Its totient is φ = 34818438333816.
The previous prime is 104455315001437. The next prime is 104455315001489. The reversal of 104455315001454 is 454100513554401.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
104455315001454 is an admirable number.
It is a super-2 number, since 2×1044553150014542 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8704609583449 + ... + 8704609583460.
It is an arithmetic number, because the mean of its divisors is an integer number (26113828750365).
Almost surely, 2104455315001454 is an apocalyptic number.
104455315001454 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104455315001454 is a wasteful number, since it uses less digits than its factorization.
104455315001454 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17409219166914.
The product of its (nonzero) digits is 480000, while the sum is 42.
Adding to 104455315001454 its reverse (454100513554401), we get a palindrome (558555828555855).
The spelling of 104455315001454 in words is "one hundred four trillion, four hundred fifty-five billion, three hundred fifteen million, one thousand, four hundred fifty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •