Base | Representation |
---|---|
bin | 100110110101100… |
… | …0000110011011000 |
3 | 10100211001102002220 |
4 | 1031223000303120 |
5 | 10132044333422 |
6 | 333150224040 |
7 | 44202226626 |
oct | 11553006330 |
9 | 3324042086 |
10 | 1303121112 |
11 | 60963a1a7 |
12 | 3044b5020 |
13 | 179c8b7a7 |
14 | c50d4516 |
15 | 79609e5c |
hex | 4dac0cd8 |
1303121112 has 16 divisors (see below), whose sum is σ = 3257802840. Its totient is φ = 434373696.
The previous prime is 1303121069. The next prime is 1303121117. The reversal of 1303121112 is 2111213031.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 1303121091 and 1303121100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1303121117) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 27148333 + ... + 27148380.
Almost surely, 21303121112 is an apocalyptic number.
1303121112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1303121112 is an abundant number, since it is smaller than the sum of its proper divisors (1954681728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1303121112 is a wasteful number, since it uses less digits than its factorization.
1303121112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 54296722 (or 54296718 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 15.
The square root of 1303121112 is about 36098.7688432722. The cubic root of 1303121112 is about 1092.2656104958.
Adding to 1303121112 its reverse (2111213031), we get a palindrome (3414334143).
It can be divided in two parts, 13031 and 21112, that added together give a palindrome (34143).
The spelling of 1303121112 in words is "one billion, three hundred three million, one hundred twenty-one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •