Base | Representation |
---|---|
bin | 111100110011110… |
… | …111111000101010 |
3 | 2122002202010010010 |
4 | 330303313320222 |
5 | 4042134344320 |
6 | 245123032350 |
7 | 34165552005 |
oct | 7463677052 |
9 | 2562663103 |
10 | 1020231210 |
11 | 483991899 |
12 | 24580b6b6 |
13 | 1334a190b |
14 | 996d653c |
15 | 5e87aae0 |
hex | 3ccf7e2a |
1020231210 has 64 divisors (see below), whose sum is σ = 2495635200. Its totient is φ = 266872320.
The previous prime is 1020231203. The next prime is 1020231221. The reversal of 1020231210 is 121320201.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 434640 + ... + 436980.
It is an arithmetic number, because the mean of its divisors is an integer number (38994300).
Almost surely, 21020231210 is an apocalyptic number.
1020231210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 1020231210, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1247817600).
1020231210 is an abundant number, since it is smaller than the sum of its proper divisors (1475403990).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1020231210 is a wasteful number, since it uses less digits than its factorization.
1020231210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2623.
The product of its (nonzero) digits is 24, while the sum is 12.
The square root of 1020231210 is about 31941.0583731973. The cubic root of 1020231210 is about 1006.6987630416.
Adding to 1020231210 its reverse (121320201), we get a palindrome (1141551411).
The spelling of 1020231210 in words is "one billion, twenty million, two hundred thirty-one thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •