Base | Representation |
---|---|
bin | 10011010010011110… |
… | …00111000011100011 |
3 | 222201200201002000102 |
4 | 21221033013003203 |
5 | 132202002101311 |
6 | 4431322213015 |
7 | 514422216545 |
oct | 115117070343 |
9 | 28650632012 |
10 | 10355503331 |
11 | 4434458a18 |
12 | 201005416b |
13 | c9054c584 |
14 | 703463695 |
15 | 4091d243b |
hex | 2693c70e3 |
10355503331 has 2 divisors, whose sum is σ = 10355503332. Its totient is φ = 10355503330.
The previous prime is 10355503321. The next prime is 10355503357. The reversal of 10355503331 is 13330555301.
10355503331 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10355503331 is a prime.
It is a super-3 number, since 3×103555033313 (a number of 31 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 10355503294 and 10355503303.
It is not a weakly prime, because it can be changed into another prime (10355503321) 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 as a sum of consecutive naturals, namely, 5177751665 + 5177751666.
It is an arithmetic number, because the mean of its divisors is an integer number (5177751666).
Almost surely, 210355503331 is an apocalyptic number.
10355503331 is a deficient number, since it is larger than the sum of its proper divisors (1).
10355503331 is an equidigital number, since it uses as much as digits as its factorization.
10355503331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10125, while the sum is 29.
The spelling of 10355503331 in words is "ten billion, three hundred fifty-five million, five hundred three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •