Base | Representation |
---|---|
bin | 11101001011000000110… |
… | …00100100000111100101 |
3 | 10112211020002212220201121 |
4 | 32211200120210013211 |
5 | 112410300133311401 |
6 | 2044245355453541 |
7 | 132263013045025 |
oct | 16454030440745 |
9 | 3484202786647 |
10 | 1002344432101 |
11 | 357101334491 |
12 | 1423171572b1 |
13 | 7369cbc997c |
14 | 3672995da85 |
15 | 1b1174b2ca1 |
hex | e9606241e5 |
1002344432101 has 2 divisors, whose sum is σ = 1002344432102. Its totient is φ = 1002344432100.
The previous prime is 1002344432099. The next prime is 1002344432149. The reversal of 1002344432101 is 1012344432001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 775553229025 + 226791203076 = 880655^2 + 476226^2 .
It is a cyclic number.
It is not a de Polignac number, because 1002344432101 - 21 = 1002344432099 is a prime.
Together with 1002344432099, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1002344432801) 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, 501172216050 + 501172216051.
It is an arithmetic number, because the mean of its divisors is an integer number (501172216051).
Almost surely, 21002344432101 is an apocalyptic number.
It is an amenable number.
1002344432101 is a deficient number, since it is larger than the sum of its proper divisors (1).
1002344432101 is an equidigital number, since it uses as much as digits as its factorization.
1002344432101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 1002344432101 its reverse (1012344432001), we get a palindrome (2014688864102).
The spelling of 1002344432101 in words is "one trillion, two billion, three hundred forty-four million, four hundred thirty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •