Base | Representation |
---|---|
bin | 1001000110010001001111… |
… | …0011000111101001000010 |
3 | 1022102022021221110111010211 |
4 | 2101210103303013221002 |
5 | 2302343240104001010 |
6 | 33135242503144334 |
7 | 2051500241363020 |
oct | 221442363075102 |
9 | 38368257414124 |
10 | 10003311000130 |
11 | 3207420301468 |
12 | 11568607450aa |
13 | 5774010bc6b6 |
14 | 26823cb6d710 |
15 | 12532096a08a |
hex | 91913cc7a42 |
10003311000130 has 32 divisors (see below), whose sum is σ = 20927023505280. Its totient is φ = 3371576006400.
The previous prime is 10003311000121. The next prime is 10003311000167. The reversal of 10003311000130 is 3100011330001.
It is a happy number.
It is a self number, because there is not a number n which added to its sum of digits gives 10003311000130.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 1211050471 + ... + 1211058730.
It is an arithmetic number, because the mean of its divisors is an integer number (653969484540).
Almost surely, 210003311000130 is an apocalyptic number.
10003311000130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10003311000130 is an abundant number, since it is smaller than the sum of its proper divisors (10923712505150).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10003311000130 is a wasteful number, since it uses less digits than its factorization.
10003311000130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2422109274.
The product of its (nonzero) digits is 27, while the sum is 13.
Adding to 10003311000130 its reverse (3100011330001), we get a palindrome (13103322330131).
The spelling of 10003311000130 in words is "ten trillion, three billion, three hundred eleven million, one hundred thirty", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •