Base | Representation |
---|---|
bin | 10010110100011010… |
… | …00111100110011001 |
3 | 222002010011222200101 |
4 | 21122031013212121 |
5 | 131142422314113 |
6 | 4350313135401 |
7 | 505240554166 |
oct | 113215074631 |
9 | 28063158611 |
10 | 10103323033 |
11 | 4315076151 |
12 | 1b5b6ba561 |
13 | c5022566b |
14 | 6bbb7b06d |
15 | 3e1ebc2dd |
hex | 25a347999 |
10103323033 has 16 divisors (see below), whose sum is σ = 10487473920. Its totient is φ = 9726480000.
The previous prime is 10103322997. The next prime is 10103323039. The reversal of 10103323033 is 33032330101.
10103323033 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 10103323033 - 29 = 10103322521 is a prime.
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 10103323033.
It is not an unprimeable number, because it can be changed into a prime (10103323039) 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 15 ways as a sum of consecutive naturals, for example, 1117216 + ... + 1126222.
It is an arithmetic number, because the mean of its divisors is an integer number (655467120).
Almost surely, 210103323033 is an apocalyptic number.
It is an amenable number.
10103323033 is a deficient number, since it is larger than the sum of its proper divisors (384150887).
10103323033 is a wasteful number, since it uses less digits than its factorization.
10103323033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9408.
The product of its (nonzero) digits is 486, while the sum is 19.
Adding to 10103323033 its reverse (33032330101), we get a palindrome (43135653134).
The spelling of 10103323033 in words is "ten billion, one hundred three million, three hundred twenty-three thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •