Base | Representation |
---|---|
bin | 10010101011101100… |
… | …01101111111000010 |
3 | 221220000121111211200 |
4 | 21111312031333002 |
5 | 131020213223020 |
6 | 4335142122030 |
7 | 503362246461 |
oct | 112566157702 |
9 | 27800544750 |
10 | 10030211010 |
11 | 4287879a96 |
12 | 1b3b120316 |
13 | c3b037501 |
14 | 6b21889d8 |
15 | 3da879590 |
hex | 255d8dfc2 |
10030211010 has 24 divisors (see below), whose sum is σ = 26078548860. Its totient is φ = 2674722912.
The previous prime is 10030210991. The next prime is 10030211011. The reversal of 10030211010 is 1011203001.
It can be written as a sum of positive squares in 2 ways, for example, as 10027418769 + 2792241 = 100137^2 + 1671^2 .
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 10030210983 and 10030211001.
It is not an unprimeable number, because it can be changed into a prime (10030211011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 55723305 + ... + 55723484.
Almost surely, 210030211010 is an apocalyptic number.
10030211010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10030211010 is an abundant number, since it is smaller than the sum of its proper divisors (16048337850).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10030211010 is a wasteful number, since it uses less digits than its factorization.
10030211010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 111446802 (or 111446799 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 9.
Adding to 10030211010 its reverse (1011203001), we get a palindrome (11041414011).
The spelling of 10030211010 in words is "ten billion, thirty million, two hundred eleven thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •