Base | Representation |
---|---|
bin | 100100010111001… |
… | …1001000110111111 |
3 | 10011000212120101112 |
4 | 1020232121012333 |
5 | 4444322333043 |
6 | 321023232235 |
7 | 42143600102 |
oct | 11056310677 |
9 | 3130776345 |
10 | 1220121023 |
11 | 5767a9a90 |
12 | 2a074867b |
13 | 165a1aa04 |
14 | b808a739 |
15 | 721b2518 |
hex | 48b991bf |
1220121023 has 8 divisors (see below), whose sum is σ = 1332600960. Its totient is φ = 1107901080.
The previous prime is 1220121017. The next prime is 1220121037. The reversal of 1220121023 is 3201210221.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1220121023 - 26 = 1220120959 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1220120989 and 1220121007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1220121073) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 55115 + ... + 74012.
It is an arithmetic number, because the mean of its divisors is an integer number (166575120).
Almost surely, 21220121023 is an apocalyptic number.
1220121023 is a deficient number, since it is larger than the sum of its proper divisors (112479937).
1220121023 is a wasteful number, since it uses less digits than its factorization.
1220121023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 129997.
The product of its (nonzero) digits is 48, while the sum is 14.
The square root of 1220121023 is about 34930.2307893893. The cubic root of 1220121023 is about 1068.5650614051.
Adding to 1220121023 its reverse (3201210221), we get a palindrome (4421331244).
The spelling of 1220121023 in words is "one billion, two hundred twenty million, one hundred twenty-one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •