Base | Representation |
---|---|
bin | 101111001110000011… |
… | …1011001100001110001 |
3 | 100200201222110010111102 |
4 | 1132130013121201301 |
5 | 3130133234324243 |
6 | 114330055254145 |
7 | 10216604650055 |
oct | 1363407314161 |
9 | 320658403442 |
10 | 101403433073 |
11 | 3a00665a148 |
12 | 1779b97a355 |
13 | 97404c0a07 |
14 | 4c9d5c7c65 |
15 | 298755b9b8 |
hex | 179c1d9871 |
101403433073 has 2 divisors, whose sum is σ = 101403433074. Its totient is φ = 101403433072.
The previous prime is 101403433063. The next prime is 101403433123. The reversal of 101403433073 is 370334304101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 50991059344 + 50412373729 = 225812^2 + 224527^2 .
It is an emirp because it is prime and its reverse (370334304101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 101403433073 - 26 = 101403433009 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (101403433063) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50701716536 + 50701716537.
It is an arithmetic number, because the mean of its divisors is an integer number (50701716537).
Almost surely, 2101403433073 is an apocalyptic number.
It is an amenable number.
101403433073 is a deficient number, since it is larger than the sum of its proper divisors (1).
101403433073 is an equidigital number, since it uses as much as digits as its factorization.
101403433073 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9072, while the sum is 29.
Adding to 101403433073 its reverse (370334304101), we get a palindrome (471737737174).
The spelling of 101403433073 in words is "one hundred one billion, four hundred three million, four hundred thirty-three thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •