Base | Representation |
---|---|
bin | 10011000011100010… |
… | …01110110011010110 |
3 | 222101221222112121221 |
4 | 21201301032303112 |
5 | 131422414331410 |
6 | 4411045200554 |
7 | 511341344053 |
oct | 114161166326 |
9 | 28357875557 |
10 | 10230230230 |
11 | 437a775430 |
12 | 1b9610015a |
13 | c705ca48c |
14 | 6d097402a |
15 | 3ed1d94da |
hex | 261c4ecd6 |
10230230230 has 32 divisors (see below), whose sum is σ = 21145743360. Its totient is φ = 3524289120.
The previous prime is 10230230221. The next prime is 10230230317. The reversal of 10230230230 is 3203203201.
10230230230 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×102302302302 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
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 15 ways as a sum of consecutive naturals, for example, 2445334 + ... + 2449513.
It is an arithmetic number, because the mean of its divisors is an integer number (660804480).
Almost surely, 210230230230 is an apocalyptic number.
10230230230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10230230230 is an abundant number, since it is smaller than the sum of its proper divisors (10915513130).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10230230230 is a wasteful number, since it uses less digits than its factorization.
10230230230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4894884.
The product of its (nonzero) digits is 216, while the sum is 16.
Adding to 10230230230 its reverse (3203203201), we get a palindrome (13433433431).
The spelling of 10230230230 in words is "ten billion, two hundred thirty million, two hundred thirty thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •