Base | Representation |
---|---|
bin | 111101011001111… |
… | …100011000100110 |
3 | 2122210112010222001 |
4 | 331121330120212 |
5 | 4102213223420 |
6 | 250120555514 |
7 | 34346435635 |
oct | 7531743046 |
9 | 2583463861 |
10 | 1030211110 |
11 | 489588945 |
12 | 249022b9a |
13 | 135587296 |
14 | 9ab7351c |
15 | 6069cb0a |
hex | 3d67c626 |
1030211110 has 16 divisors (see below), whose sum is σ = 1872742032. Its totient is φ = 408004000.
The previous prime is 1030211081. The next prime is 1030211123. The reversal of 1030211110 is 111120301.
It is a super-2 number, since 2×10302111102 = 2122669862334864200, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (10).
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, 508996 + ... + 511015.
It is an arithmetic number, because the mean of its divisors is an integer number (117046377).
Almost surely, 21030211110 is an apocalyptic number.
1030211110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1030211110 is a deficient number, since it is larger than the sum of its proper divisors (842530922).
1030211110 is a wasteful number, since it uses less digits than its factorization.
1030211110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1020119.
The product of its (nonzero) digits is 6, while the sum is 10.
The square root of 1030211110 is about 32096.9018754147. The cubic root of 1030211110 is about 1009.9706262084.
Adding to 1030211110 its reverse (111120301), we get a palindrome (1141331411).
It can be divided in two parts, 10302 and 11110, that added together give a palindrome (21412).
The spelling of 1030211110 in words is "one billion, thirty million, two hundred eleven thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •