Base | Representation |
---|---|
bin | 1010011010101100001001… |
… | …0001101011011010010100 |
3 | 1111112221212000112102202102 |
4 | 2212223002101223122110 |
5 | 3000124024402202200 |
6 | 40205421450501232 |
7 | 2261332634365622 |
oct | 246530221533224 |
9 | 44487760472672 |
10 | 11453642225300 |
11 | 371650a493110 |
12 | 134b961734818 |
13 | 6510c62778c2 |
14 | 2b8505a8a512 |
15 | 14ce0759a6d5 |
hex | a6ac246b694 |
11453642225300 has 144 divisors (see below), whose sum is σ = 27362252037120. Its totient is φ = 4126977216000.
The previous prime is 11453642225261. The next prime is 11453642225303. The reversal of 11453642225300 is 352224635411.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11453642225303) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 55046861 + ... + 55254539.
Almost surely, 211453642225300 is an apocalyptic number.
11453642225300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11453642225300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13681126018560).
11453642225300 is an abundant number, since it is smaller than the sum of its proper divisors (15908609811820).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11453642225300 is a wasteful number, since it uses less digits than its factorization.
11453642225300 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 208162 (or 208155 counting only the distinct ones).
The product of its (nonzero) digits is 172800, while the sum is 38.
The spelling of 11453642225300 in words is "eleven trillion, four hundred fifty-three billion, six hundred forty-two million, two hundred twenty-five thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •