Base | Representation |
---|---|
bin | 1010001110100100001011… |
… | …0000110010011000010100 |
3 | 1110211001012101112221000020 |
4 | 2203221002300302120110 |
5 | 2433220431140411302 |
6 | 35530012342545140 |
7 | 2240310055555065 |
oct | 243510260623024 |
9 | 43731171487006 |
10 | 11245344466452 |
11 | 364613a870978 |
12 | 131750b1381b0 |
13 | 63757bb20965 |
14 | 2ac3c595256c |
15 | 1477b5910ebc |
hex | a3a42c32614 |
11245344466452 has 24 divisors (see below), whose sum is σ = 26239196896416. Its totient is φ = 3748439611488.
The previous prime is 11245344466429. The next prime is 11245344466511. The reversal of 11245344466452 is 25466444354211.
It is a junction number, because it is equal to n+sod(n) for n = 11245344466395 and 11245344466404.
It is a congruent number.
It is an unprimeable number.
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, 6642963 + ... + 8162085.
It is an arithmetic number, because the mean of its divisors is an integer number (1093299870684).
Almost surely, 211245344466452 is an apocalyptic number.
11245344466452 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11245344466452 is an abundant number, since it is smaller than the sum of its proper divisors (14993852429964).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11245344466452 is a wasteful number, since it uses less digits than its factorization.
11245344466452 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2136007 (or 2136005 counting only the distinct ones).
The product of its digits is 11059200, while the sum is 51.
The spelling of 11245344466452 in words is "eleven trillion, two hundred forty-five billion, three hundred forty-four million, four hundred sixty-six thousand, four hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •