Base | Representation |
---|---|
bin | 100100000011111… |
… | …0100110111111010 |
3 | 10010022211221020001 |
4 | 1020013310313322 |
5 | 4434230324010 |
6 | 320022423214 |
7 | 41661632146 |
oct | 11007646772 |
9 | 3108757201 |
10 | 1210011130 |
11 | 5710242a9 |
12 | 299291b0a |
13 | 1638bb123 |
14 | b69b8226 |
15 | 71366c3a |
hex | 481f4dfa |
1210011130 has 8 divisors (see below), whose sum is σ = 2178020052. Its totient is φ = 484004448.
The previous prime is 1210011107. The next prime is 1210011151. The reversal of 1210011130 is 311100121.
It can be written as a sum of positive squares in 2 ways, for example, as 1070794729 + 139216401 = 32723^2 + 11799^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (10), and also a Moran number because the ratio is a prime number: 121001113 = 1210011130 / (1 + 2 + 1 + 0 + 0 + 1 + 1 + 1 + 3 + 0).
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 3 ways as a sum of consecutive naturals, for example, 60500547 + ... + 60500566.
Almost surely, 21210011130 is an apocalyptic number.
1210011130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1210011130 is a deficient number, since it is larger than the sum of its proper divisors (968008922).
1210011130 is a wasteful number, since it uses less digits than its factorization.
1210011130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 121001120.
The product of its (nonzero) digits is 6, while the sum is 10.
The square root of 1210011130 is about 34785.2142439859. The cubic root of 1210011130 is about 1065.6055040163.
Adding to 1210011130 its reverse (311100121), we get a palindrome (1521111251).
The spelling of 1210011130 in words is "one billion, two hundred ten million, eleven thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •