Base | Representation |
---|---|
bin | 100100010111001… |
… | …1001110111001001 |
3 | 10011000212201121200 |
4 | 1020232121313021 |
5 | 4444322432410 |
6 | 321023254413 |
7 | 42143612064 |
oct | 11056316711 |
9 | 3130781550 |
10 | 1220124105 |
11 | 576801332 |
12 | 2a074a409 |
13 | 165a1c235 |
14 | b808b8db |
15 | 721b33c0 |
hex | 48b99dc9 |
1220124105 has 24 divisors (see below), whose sum is σ = 2187811080. Its totient is φ = 628293120.
The previous prime is 1220124053. The next prime is 1220124107. The reversal of 1220124105 is 5014210221.
It can be written as a sum of positive squares in 4 ways, for example, as 362102841 + 858021264 = 19029^2 + 29292^2 .
It is not a de Polignac number, because 1220124105 - 26 = 1220124041 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1220124107) 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, 466176 + ... + 468785.
It is an arithmetic number, because the mean of its divisors is an integer number (91158795).
Almost surely, 21220124105 is an apocalyptic number.
1220124105 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1220124105 is a deficient number, since it is larger than the sum of its proper divisors (967686975).
1220124105 is a wasteful number, since it uses less digits than its factorization.
1220124105 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 935001 (or 934998 counting only the distinct ones).
The product of its (nonzero) digits is 160, while the sum is 18.
The square root of 1220124105 is about 34930.2749058750. The cubic root of 1220124105 is about 1068.5659611286.
Adding to 1220124105 its reverse (5014210221), we get a palindrome (6234334326).
The spelling of 1220124105 in words is "one billion, two hundred twenty million, one hundred twenty-four thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •