Base | Representation |
---|---|
bin | 1001011111110111010010… |
… | …1100011011100110001001 |
3 | 1100222100021020201202121211 |
4 | 2113331310230123212021 |
5 | 2332044302431113001 |
6 | 34113243023533121 |
7 | 2125324565306614 |
oct | 227756454334611 |
9 | 40870236652554 |
10 | 10443023301001 |
11 | 336695244a225 |
12 | 1207b1745a1a1 |
13 | 5a9a07ccb405 |
14 | 28163320d17b |
15 | 1319a896b351 |
hex | 97f74b1b989 |
10443023301001 has 2 divisors, whose sum is σ = 10443023301002. Its totient is φ = 10443023301000.
The previous prime is 10443023300999. The next prime is 10443023301041. The reversal of 10443023301001 is 10010332034401.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8614524372601 + 1828498928400 = 2935051^2 + 1352220^2 .
It is an emirp because it is prime and its reverse (10010332034401) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10443023301001 - 21 = 10443023300999 is a prime.
Together with 10443023300999, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (10443023301041) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5221511650500 + 5221511650501.
It is an arithmetic number, because the mean of its divisors is an integer number (5221511650501).
Almost surely, 210443023301001 is an apocalyptic number.
It is an amenable number.
10443023301001 is a deficient number, since it is larger than the sum of its proper divisors (1).
10443023301001 is an equidigital number, since it uses as much as digits as its factorization.
10443023301001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 10443023301001 its reverse (10010332034401), we get a palindrome (20453355335402).
The spelling of 10443023301001 in words is "ten trillion, four hundred forty-three billion, twenty-three million, three hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •