Base | Representation |
---|---|
bin | 10010101001010100… |
… | …11000111101010101 |
3 | 221211122012121100120 |
4 | 21110222120331111 |
5 | 131000121124023 |
6 | 4333152102153 |
7 | 503031266232 |
oct | 112452307525 |
9 | 27748177316 |
10 | 10010333013 |
11 | 427763239a |
12 | 1b34534959 |
13 | c36b97795 |
14 | 6ad692789 |
15 | 3d8c4e8e3 |
hex | 254a98f55 |
10010333013 has 24 divisors (see below), whose sum is σ = 13842628800. Its totient is φ = 6434391936.
The previous prime is 10010332993. The next prime is 10010333029. The reversal of 10010333013 is 31033301001.
10010333013 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10010333013 - 26 = 10010332949 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10010332983 and 10010333001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10010333413) 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, 2114433 + ... + 2119161.
It is an arithmetic number, because the mean of its divisors is an integer number (576776200).
Almost surely, 210010333013 is an apocalyptic number.
It is an amenable number.
10010333013 is a deficient number, since it is larger than the sum of its proper divisors (3832295787).
10010333013 is an equidigital number, since it uses as much as digits as its factorization.
10010333013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5629 (or 5600 counting only the distinct ones).
The product of its (nonzero) digits is 81, while the sum is 15.
Adding to 10010333013 its reverse (31033301001), we get a palindrome (41043634014).
The spelling of 10010333013 in words is "ten billion, ten million, three hundred thirty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •