Base | Representation |
---|---|
bin | 1001001110111011100001… |
… | …1000110011011110100101 |
3 | 1022221112100101112100001211 |
4 | 2103232320120303132211 |
5 | 2312313000403334001 |
6 | 33331451054151421 |
7 | 2065315350436066 |
oct | 223567030633645 |
9 | 38845311470054 |
10 | 10152101230501 |
11 | 32645335307aa |
12 | 117b6661b2571 |
13 | 588453b36929 |
14 | 2715159aa56d |
15 | 12912d22e351 |
hex | 93bb86337a5 |
10152101230501 has 2 divisors, whose sum is σ = 10152101230502. Its totient is φ = 10152101230500.
The previous prime is 10152101230493. The next prime is 10152101230511. The reversal of 10152101230501 is 10503210125101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9541086988225 + 611014242276 = 3088865^2 + 781674^2 .
It is a cyclic number.
It is not a de Polignac number, because 10152101230501 - 23 = 10152101230493 is a prime.
It is a super-2 number, since 2×101521012305012 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10152101230511) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5076050615250 + 5076050615251.
It is an arithmetic number, because the mean of its divisors is an integer number (5076050615251).
Almost surely, 210152101230501 is an apocalyptic number.
It is an amenable number.
10152101230501 is a deficient number, since it is larger than the sum of its proper divisors (1).
10152101230501 is an equidigital number, since it uses as much as digits as its factorization.
10152101230501 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 300, while the sum is 22.
Adding to 10152101230501 its reverse (10503210125101), we get a palindrome (20655311355602).
The spelling of 10152101230501 in words is "ten trillion, one hundred fifty-two billion, one hundred one million, two hundred thirty thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •