Base | Representation |
---|---|
bin | 1001001100001000100000… |
… | …0001110011001101001011 |
3 | 1022202221022021201202120222 |
4 | 2103002020001303031023 |
5 | 2311021041041102301 |
6 | 33253422335540255 |
7 | 2061664442404532 |
oct | 223021001631513 |
9 | 38687267652528 |
10 | 10104045253451 |
11 | 3246113151996 |
12 | 117229438a68b |
13 | 583a65a72456 |
14 | 26d077523319 |
15 | 127c6939131b |
hex | 9308807334b |
10104045253451 has 8 divisors (see below), whose sum is σ = 10145689363440. Its totient is φ = 10062473131648.
The previous prime is 10104045253369. The next prime is 10104045253483. The reversal of 10104045253451 is 15435254040101.
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-10104045253451 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10104045223451) 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 7 ways as a sum of consecutive naturals, for example, 17715746 + ... + 18277191.
It is an arithmetic number, because the mean of its divisors is an integer number (1268211170430).
Almost surely, 210104045253451 is an apocalyptic number.
10104045253451 is a deficient number, since it is larger than the sum of its proper divisors (41644109989).
10104045253451 is an equidigital number, since it uses as much as digits as its factorization.
10104045253451 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35994093.
The product of its (nonzero) digits is 48000, while the sum is 35.
Adding to 10104045253451 its reverse (15435254040101), we get a palindrome (25539299293552).
The spelling of 10104045253451 in words is "ten trillion, one hundred four billion, forty-five million, two hundred fifty-three thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •