Base | Representation |
---|---|
bin | 111100111110111… |
… | …001011001110010 |
3 | 2122022011221011202 |
4 | 330332321121302 |
5 | 4043404333020 |
6 | 245305011202 |
7 | 34232246042 |
oct | 7476713162 |
9 | 2568157152 |
10 | 1023121010 |
11 | 485585a5a |
12 | 246783b02 |
13 | 133c74062 |
14 | 99c49722 |
15 | 5ec4be75 |
hex | 3cfb9672 |
1023121010 has 16 divisors (see below), whose sum is σ = 1876366296. Its totient is φ = 401526528.
The previous prime is 1023120977. The next prime is 1023121019. The reversal of 1023121010 is 101213201.
It can be written as a sum of positive squares in 4 ways, for example, as 656743129 + 366377881 = 25627^2 + 19141^2 .
It is a super-2 number, since 2×10231210102 = 2093553202206840200, which contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1023120982 and 1023121000.
It is not an unprimeable number, because it can be changed into a prime (1023121019) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 964679 + ... + 965738.
Almost surely, 21023121010 is an apocalyptic number.
1023121010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1023121010 is a deficient number, since it is larger than the sum of its proper divisors (853245286).
1023121010 is a wasteful number, since it uses less digits than its factorization.
1023121010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1930477.
The product of its (nonzero) digits is 12, while the sum is 11.
The square root of 1023121010 is about 31986.2628326599. The cubic root of 1023121010 is about 1007.6483568348.
Adding to 1023121010 its reverse (101213201), we get a palindrome (1124334211).
The spelling of 1023121010 in words is "one billion, twenty-three million, one hundred twenty-one thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •