Base | Representation |
---|---|
bin | 111100110100111… |
… | …001110011100111 |
3 | 2122010020211111121 |
4 | 330310321303213 |
5 | 4042222014343 |
6 | 245132514411 |
7 | 34201055140 |
oct | 7464716347 |
9 | 2563224447 |
10 | 1020501223 |
11 | 484056745 |
12 | 24591ba07 |
13 | 1335677a1 |
14 | 99766ac7 |
15 | 5e8d0aed |
hex | 3cd39ce7 |
1020501223 has 16 divisors (see below), whose sum is σ = 1187988480. Its totient is φ = 858570336.
The previous prime is 1020501221. The next prime is 1020501233. The reversal of 1020501223 is 3221050201.
It is a cyclic number.
It is not a de Polignac number, because 1020501223 - 21 = 1020501221 is a prime.
It is a super-2 number, since 2×10205012232 = 2082845492288991458, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1020501197 and 1020501206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1020501221) 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 15 ways as a sum of consecutive naturals, for example, 90336 + ... + 101002.
It is an arithmetic number, because the mean of its divisors is an integer number (74249280).
Almost surely, 21020501223 is an apocalyptic number.
1020501223 is a deficient number, since it is larger than the sum of its proper divisors (167487257).
1020501223 is a wasteful number, since it uses less digits than its factorization.
1020501223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10926.
The product of its (nonzero) digits is 120, while the sum is 16.
The square root of 1020501223 is about 31945.2848320374. The cubic root of 1020501223 is about 1006.7875657149.
Adding to 1020501223 its reverse (3221050201), we get a palindrome (4241551424).
The spelling of 1020501223 in words is "one billion, twenty million, five hundred one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •