Base | Representation |
---|---|
bin | 101101101110101111011011… |
… | …011001101100000100110001 |
3 | 222101010021111100102001222122 |
4 | 231232233123121230010301 |
5 | 202330204141303423400 |
6 | 1551431050452444025 |
7 | 60235511023115330 |
oct | 5556573331540461 |
9 | 871107440361878 |
10 | 201124114514225 |
11 | 590a2292391841 |
12 | 1a68324b019615 |
13 | 882bbcbcb9486 |
14 | 379465da15d17 |
15 | 183ba76b01685 |
hex | b6ebdb66c131 |
201124114514225 has 48 divisors (see below), whose sum is σ = 300827091607680. Its totient is φ = 130304781388800.
The previous prime is 201124114514201. The next prime is 201124114514237. The reversal of 201124114514225 is 522415411421102.
It is not a de Polignac number, because 201124114514225 - 218 = 201124114252081 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (35).
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 79843496 + ... + 82323945.
It is an arithmetic number, because the mean of its divisors is an integer number (6267231075160).
Almost surely, 2201124114514225 is an apocalyptic number.
201124114514225 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
201124114514225 is a deficient number, since it is larger than the sum of its proper divisors (99702977093455).
201124114514225 is a wasteful number, since it uses less digits than its factorization.
201124114514225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 162167850 (or 162167845 counting only the distinct ones).
The product of its (nonzero) digits is 25600, while the sum is 35.
Adding to 201124114514225 its reverse (522415411421102), we get a palindrome (723539525935327).
The spelling of 201124114514225 in words is "two hundred one trillion, one hundred twenty-four billion, one hundred fourteen million, five hundred fourteen thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •