Base | Representation |
---|---|
bin | 10011000011111010… |
… | …00100010100011100 |
3 | 222102011211011212002 |
4 | 21201331010110130 |
5 | 131424213124040 |
6 | 4411235501432 |
7 | 511406616101 |
oct | 114175042434 |
9 | 28364734762 |
10 | 10233333020 |
11 | 43814a4619 |
12 | 1b97157878 |
13 | c71145851 |
14 | 6d1140aa8 |
15 | 3ed5eda15 |
hex | 261f4451c |
10233333020 has 24 divisors (see below), whose sum is σ = 21532240800. Its totient is φ = 4085287232.
The previous prime is 10233333013. The next prime is 10233333031. The reversal of 10233333020 is 2033333201.
It is a super-2 number, since 2×102333330202 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a junction number, because it is equal to n+sod(n) for n = 10233332983 and 10233333001.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 492440 + ... + 512799.
It is an arithmetic number, because the mean of its divisors is an integer number (897176700).
Almost surely, 210233333020 is an apocalyptic number.
10233333020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10233333020 is an abundant number, since it is smaller than the sum of its proper divisors (11298907780).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10233333020 is a wasteful number, since it uses less digits than its factorization.
10233333020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1005757 (or 1005755 counting only the distinct ones).
The product of its (nonzero) digits is 972, while the sum is 20.
Adding to 10233333020 its reverse (2033333201), we get a palindrome (12266666221).
The spelling of 10233333020 in words is "ten billion, two hundred thirty-three million, three hundred thirty-three thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •