Base | Representation |
---|---|
bin | 100100011011110… |
… | …1011011001011110 |
3 | 10011012110020111100 |
4 | 1020313223121132 |
5 | 10000433231410 |
6 | 321151333530 |
7 | 42203355651 |
oct | 11067533136 |
9 | 3135406440 |
10 | 1222555230 |
11 | 578111926 |
12 | 2a15212a6 |
13 | 166390980 |
14 | b8521898 |
15 | 724e38c0 |
hex | 48deb65e |
1222555230 has 96 divisors (see below), whose sum is σ = 3444202944. Its totient is φ = 299086848.
The previous prime is 1222555183. The next prime is 1222555241. The reversal of 1222555230 is 325552221.
It is a junction number, because it is equal to n+sod(n) for n = 1222555194 and 1222555203.
It is a congruent number.
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, 192262 + ... + 198518.
It is an arithmetic number, because the mean of its divisors is an integer number (35877114).
Almost surely, 21222555230 is an apocalyptic number.
1222555230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 1222555230, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1722101472).
1222555230 is an abundant number, since it is smaller than the sum of its proper divisors (2221647714).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1222555230 is a wasteful number, since it uses less digits than its factorization.
1222555230 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6450 (or 6447 counting only the distinct ones).
The product of its (nonzero) digits is 6000, while the sum is 27.
The square root of 1222555230 is about 34965.0572715104. The cubic root of 1222555230 is about 1069.2752042610.
The spelling of 1222555230 in words is "one billion, two hundred twenty-two million, five hundred fifty-five thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •