Base | Representation |
---|---|
bin | 10010110101100110… |
… | …10010110000110110 |
3 | 222002211000101222022 |
4 | 21122303102300312 |
5 | 131203003031410 |
6 | 4351311433142 |
7 | 505421613533 |
oct | 113263226066 |
9 | 28084011868 |
10 | 10113330230 |
11 | 431a790763 |
12 | 1b62b257b2 |
13 | c5231a593 |
14 | 6bd223d8a |
15 | 3e2ce7455 |
hex | 25acd2c36 |
10113330230 has 16 divisors (see below), whose sum is σ = 18995472864. Its totient is φ = 3869448000.
The previous prime is 10113330223. The next prime is 10113330251. The reversal of 10113330230 is 3203331101.
10113330230 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-4 number, since 4×101133302304 (a number of 41 digits) contains 4444 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10113330199 and 10113330208.
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 7 ways as a sum of consecutive naturals, for example, 21985271 + ... + 21985730.
It is an arithmetic number, because the mean of its divisors is an integer number (1187217054).
Almost surely, 210113330230 is an apocalyptic number.
10113330230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10113330230 is a deficient number, since it is larger than the sum of its proper divisors (8882142634).
10113330230 is a wasteful number, since it uses less digits than its factorization.
10113330230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43971031.
The product of its (nonzero) digits is 162, while the sum is 17.
Adding to 10113330230 its reverse (3203331101), we get a palindrome (13316661331).
The spelling of 10113330230 in words is "ten billion, one hundred thirteen million, three hundred thirty thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •