Base | Representation |
---|---|
bin | 1001100000100001000101… |
… | …1001111001100010011101 |
3 | 1101000102020010110001202021 |
4 | 2120020101121321202131 |
5 | 2332240242023303123 |
6 | 34122340200100141 |
7 | 2126202605135350 |
oct | 230102131714235 |
9 | 41012203401667 |
10 | 10454242400413 |
11 | 337068a325709 |
12 | 120a128764651 |
13 | 5aaaa5439586 |
14 | 281db9234297 |
15 | 131e13888c5d |
hex | 9821167989d |
10454242400413 has 8 divisors (see below), whose sum is σ = 11948522878080. Its totient is φ = 8960166242160.
The previous prime is 10454242400363. The next prime is 10454242400419. The reversal of 10454242400413 is 31400424245401.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10454242400413 - 29 = 10454242399901 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 (10454242400419) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 50970193 + ... + 51174886.
It is an arithmetic number, because the mean of its divisors is an integer number (1493565359760).
Almost surely, 210454242400413 is an apocalyptic number.
It is an amenable number.
10454242400413 is a deficient number, since it is larger than the sum of its proper divisors (1494280477667).
10454242400413 is a wasteful number, since it uses less digits than its factorization.
10454242400413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 102159707.
The product of its (nonzero) digits is 61440, while the sum is 34.
Adding to 10454242400413 its reverse (31400424245401), we get a palindrome (41854666645814).
The spelling of 10454242400413 in words is "ten trillion, four hundred fifty-four billion, two hundred forty-two million, four hundred thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •