Base | Representation |
---|---|
bin | 10011000011111000… |
… | …10011001111101000 |
3 | 222102011102222010012 |
4 | 21201330103033220 |
5 | 131424140211013 |
6 | 4411231311052 |
7 | 511405121051 |
oct | 114174231750 |
9 | 28364388105 |
10 | 10233132008 |
11 | 43813775a0 |
12 | 1b9707b488 |
13 | c710a51c8 |
14 | 6d10cb728 |
15 | 3ed5ae1a8 |
hex | 261f133e8 |
10233132008 has 32 divisors (see below), whose sum is σ = 20959413120. Its totient is φ = 4645200000.
The previous prime is 10233131999. The next prime is 10233132037. The reversal of 10233132008 is 80023133201.
10233132008 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×102331320082 (a number of 21 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11333 + ... + 143508.
It is an arithmetic number, because the mean of its divisors is an integer number (654981660).
Almost surely, 210233132008 is an apocalyptic number.
It is an amenable number.
10233132008 is an abundant number, since it is smaller than the sum of its proper divisors (10726281112).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10233132008 is a wasteful number, since it uses less digits than its factorization.
10233132008 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 155609 (or 155605 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 10233132008 its reverse (80023133201), we get a palindrome (90256265209).
It can be divided in two parts, 10233 and 132008, that added together give a palindrome (142241).
The spelling of 10233132008 in words is "ten billion, two hundred thirty-three million, one hundred thirty-two thousand, eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •