Base | Representation |
---|---|
bin | 11101011010000001010… |
… | …11000001011011000111 |
3 | 10120121000200020202122202 |
4 | 32231000223001123013 |
5 | 113023300444200112 |
6 | 2052101124345115 |
7 | 132666466064414 |
oct | 16550053013307 |
9 | 3517020222582 |
10 | 1010402334407 |
11 | 35a56685a784 |
12 | 1439a584519b |
13 | 74385433cbb |
14 | 36c91bbb10b |
15 | 1b439ae96c2 |
hex | eb40ac16c7 |
1010402334407 has 2 divisors, whose sum is σ = 1010402334408. Its totient is φ = 1010402334406.
The previous prime is 1010402334349. The next prime is 1010402334413. The reversal of 1010402334407 is 7044332040101.
It is a strong prime.
It is an emirp because it is prime and its reverse (7044332040101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1010402334407 - 210 = 1010402333383 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1010402334407.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1010402334107) 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, 505201167203 + 505201167204.
It is an arithmetic number, because the mean of its divisors is an integer number (505201167204).
Almost surely, 21010402334407 is an apocalyptic number.
1010402334407 is a deficient number, since it is larger than the sum of its proper divisors (1).
1010402334407 is an equidigital number, since it uses as much as digits as its factorization.
1010402334407 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8064, while the sum is 29.
Adding to 1010402334407 its reverse (7044332040101), we get a palindrome (8054734374508).
The spelling of 1010402334407 in words is "one trillion, ten billion, four hundred two million, three hundred thirty-four thousand, four hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •