Base | Representation |
---|---|
bin | 1010010111101100100110… |
… | …0110011110111010111101 |
3 | 1111101001010200220210000020 |
4 | 2211323021212132322331 |
5 | 2443303224212342000 |
6 | 40130035440122353 |
7 | 2254532530501020 |
oct | 245731146367275 |
9 | 44331120823006 |
10 | 11402225512125 |
11 | 36a6725056528 |
12 | 13419b23063b9 |
13 | 6492c0b57076 |
14 | 2b5c291371b7 |
15 | 14b8e865dba0 |
hex | a5ec999eebd |
11402225512125 has 32 divisors (see below), whose sum is σ = 21683775150336. Its totient is φ = 5212445947200.
The previous prime is 11402225512109. The next prime is 11402225512129. The reversal of 11402225512125 is 52121552220411.
It is not a de Polignac number, because 11402225512125 - 24 = 11402225512109 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11402225512129) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2171849854 + ... + 2171855103.
It is an arithmetic number, because the mean of its divisors is an integer number (677617973448).
Almost surely, 211402225512125 is an apocalyptic number.
11402225512125 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
11402225512125 is a deficient number, since it is larger than the sum of its proper divisors (10281549638211).
11402225512125 is an equidigital number, since it uses as much as digits as its factorization.
11402225512125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4343704982 (or 4343704972 counting only the distinct ones).
The product of its (nonzero) digits is 16000, while the sum is 33.
Adding to 11402225512125 its reverse (52121552220411), we get a palindrome (63523777732536).
The spelling of 11402225512125 in words is "eleven trillion, four hundred two billion, two hundred twenty-five million, five hundred twelve thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •