Base | Representation |
---|---|
bin | 10010110111100101… |
… | …11000110001110011 |
3 | 222010222101100222122 |
4 | 21123302320301303 |
5 | 131221240013021 |
6 | 4353105024455 |
7 | 506013405434 |
oct | 113362706163 |
9 | 28128340878 |
10 | 10130001011 |
11 | 4329137769 |
12 | 1b6862512b |
13 | c55906550 |
14 | 6c152348b |
15 | 3e44dbbab |
hex | 25bcb8c73 |
10130001011 has 8 divisors (see below), whose sum is σ = 10928616720. Its totient is φ = 9334154592.
The previous prime is 10130000999. The next prime is 10130001053. The reversal of 10130001011 is 11010003101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10130001011 is a prime.
It is a super-2 number, since 2×101300010112 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10130001011.
It is not an unprimeable number, because it can be changed into a prime (10130001061) 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 7 ways as a sum of consecutive naturals, for example, 684716 + ... + 699353.
It is an arithmetic number, because the mean of its divisors is an integer number (1366077090).
Almost surely, 210130001011 is an apocalyptic number.
10130001011 is a deficient number, since it is larger than the sum of its proper divisors (798615709).
10130001011 is a wasteful number, since it uses less digits than its factorization.
10130001011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1384645.
The product of its (nonzero) digits is 3, while the sum is 8.
Adding to 10130001011 its reverse (11010003101), we get a palindrome (21140004112).
The spelling of 10130001011 in words is "ten billion, one hundred thirty million, one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •