Base | Representation |
---|---|
bin | 1001011101011011100101… |
… | …0010101101001010011001 |
3 | 1100211100101012221021201011 |
4 | 2113112321102231022121 |
5 | 2330403201433342103 |
6 | 34042131230453521 |
7 | 2122315016414506 |
oct | 227267122551231 |
9 | 40740335837634 |
10 | 10401224512153 |
11 | 3350153094532 |
12 | 11bb9b10642a1 |
13 | 5a5aa6391167 |
14 | 27d5c9ba24ad |
15 | 13085e0b9d6d |
hex | 975b94ad299 |
10401224512153 has 8 divisors (see below), whose sum is σ = 11013108844320. Its totient is φ = 9789345468480.
The previous prime is 10401224512009. The next prime is 10401224512181. The reversal of 10401224512153 is 35121542210401.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10401224512153 - 217 = 10401224381081 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10401224512853) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3161578 + ... + 5549596.
It is an arithmetic number, because the mean of its divisors is an integer number (1376638605540).
Almost surely, 210401224512153 is an apocalyptic number.
It is an amenable number.
10401224512153 is a deficient number, since it is larger than the sum of its proper divisors (611884332167).
10401224512153 is a wasteful number, since it uses less digits than its factorization.
10401224512153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2644247.
The product of its (nonzero) digits is 9600, while the sum is 31.
Adding to 10401224512153 its reverse (35121542210401), we get a palindrome (45522766722554).
The spelling of 10401224512153 in words is "ten trillion, four hundred one billion, two hundred twenty-four million, five hundred twelve thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •