Base | Representation |
---|---|
bin | 10010000100010010011… |
… | …100111011100000011000 |
3 | 11101200200010000001002110 |
4 | 102010102130323200120 |
5 | 130320201102402300 |
6 | 2350210151032320 |
7 | 155461615261551 |
oct | 22042234734030 |
9 | 4350603001073 |
10 | 1241555122200 |
11 | 4395a4554498 |
12 | 18075636b6a0 |
13 | 901028bc203 |
14 | 4413d467328 |
15 | 22467ea9550 |
hex | 1211273b818 |
1241555122200 has 96 divisors (see below), whose sum is σ = 3850630954560. Its totient is φ = 330925660800.
The previous prime is 1241555122187. The next prime is 1241555122207. The reversal of 1241555122200 is 22215551421.
It is a super-2 number, since 2×12415551222002 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1241555122207) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 793087 + ... + 1764113.
It is an arithmetic number, because the mean of its divisors is an integer number (40110739110).
Almost surely, 21241555122200 is an apocalyptic number.
1241555122200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1241555122200 is an abundant number, since it is smaller than the sum of its proper divisors (2609075832360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1241555122200 is a wasteful number, since it uses less digits than its factorization.
1241555122200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 973177 (or 973168 counting only the distinct ones).
The product of its (nonzero) digits is 8000, while the sum is 30.
The spelling of 1241555122200 in words is "one trillion, two hundred forty-one billion, five hundred fifty-five million, one hundred twenty-two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •