Base | Representation |
---|---|
bin | 100000110010101010101… |
… | …010111011110111001110 |
3 | 21222102111011000222201220 |
4 | 200302222222323313032 |
5 | 243410004104320240 |
6 | 4443113144544210 |
7 | 321543001021350 |
oct | 40625252736716 |
9 | 7872434028656 |
10 | 2253426245070 |
11 | 799744406730 |
12 | 30488ba82066 |
13 | 134660407bc0 |
14 | 7b0d03410d0 |
15 | 3d93b9d55d0 |
hex | 20caaabbdce |
2253426245070 has 512 divisors, whose sum is σ = 7327601197056. Its totient is φ = 428302080000.
The previous prime is 2253426245047. The next prime is 2253426245117. The reversal of 2253426245070 is 705426243522.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a congruent number.
It is an unprimeable number.
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 255 ways as a sum of consecutive naturals, for example, 3000567195 + ... + 3000567945.
It is an arithmetic number, because the mean of its divisors is an integer number (14311721088).
Almost surely, 22253426245070 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2253426245070, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3663800598528).
2253426245070 is an abundant number, since it is smaller than the sum of its proper divisors (5074174951986).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2253426245070 is a wasteful number, since it uses less digits than its factorization.
2253426245070 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1568.
The product of its (nonzero) digits is 806400, while the sum is 42.
The spelling of 2253426245070 in words is "two trillion, two hundred fifty-three billion, four hundred twenty-six million, two hundred forty-five thousand, seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •