Base | Representation |
---|---|
bin | 11101011011001000100… |
… | …11000000110010100010 |
3 | 10120122120022220100100000 |
4 | 32231210103000302202 |
5 | 113031012001121010 |
6 | 2052240315040430 |
7 | 133020344244402 |
oct | 16554423006242 |
9 | 3518508810300 |
10 | 1011000020130 |
11 | 35a843177921 |
12 | 143b31a40116 |
13 | 7444c1cc3a9 |
14 | 36d0b320802 |
15 | 1b47230b7c0 |
hex | eb644c0ca2 |
1011000020130 has 48 divisors (see below), whose sum is σ = 2725955616384. Its totient is φ = 269600004720.
The previous prime is 1011000020101. The next prime is 1011000020137. The reversal of 1011000020130 is 310200001101.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (1011000020137) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 208022266 + ... + 208027125.
It is an arithmetic number, because the mean of its divisors is an integer number (56790742008).
Almost surely, 21011000020130 is an apocalyptic number.
1011000020130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1011000020130 is an abundant number, since it is smaller than the sum of its proper divisors (1714955596254).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1011000020130 is an equidigital number, since it uses as much as digits as its factorization.
1011000020130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 416049413 (or 416049401 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 9.
Adding to 1011000020130 its reverse (310200001101), we get a palindrome (1321200021231).
The spelling of 1011000020130 in words is "one trillion, eleven billion, twenty thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •