Base | Representation |
---|---|
bin | 1001011010101000000011… |
… | …1110111000010011010111 |
3 | 1100122201222211011002000201 |
4 | 2112222000332320103113 |
5 | 2324111003444304201 |
6 | 34004041345321331 |
7 | 2115660601535062 |
oct | 226520076702327 |
9 | 40581884132021 |
10 | 10353035150551 |
11 | 3331774491955 |
12 | 11b25a2636247 |
13 | 5a1396797802 |
14 | 27b137b178d9 |
15 | 12e48d680801 |
hex | 96a80fb84d7 |
10353035150551 has 2 divisors, whose sum is σ = 10353035150552. Its totient is φ = 10353035150550.
The previous prime is 10353035150531. The next prime is 10353035150561. The reversal of 10353035150551 is 15505153035301.
10353035150551 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10353035150551 - 25 = 10353035150519 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10353035150551.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10353035150531) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5176517575275 + 5176517575276.
It is an arithmetic number, because the mean of its divisors is an integer number (5176517575276).
Almost surely, 210353035150551 is an apocalyptic number.
10353035150551 is a deficient number, since it is larger than the sum of its proper divisors (1).
10353035150551 is an equidigital number, since it uses as much as digits as its factorization.
10353035150551 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 84375, while the sum is 37.
Adding to 10353035150551 its reverse (15505153035301), we get a palindrome (25858188185852).
The spelling of 10353035150551 in words is "ten trillion, three hundred fifty-three billion, thirty-five million, one hundred fifty thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •