Base | Representation |
---|---|
bin | 11101110001101011100… |
… | …01101011100100101111 |
3 | 10121210210220111012102201 |
4 | 32320311301223210233 |
5 | 113230304213314211 |
6 | 2102001354402331 |
7 | 133626324121234 |
oct | 16706561534457 |
9 | 3553726435381 |
10 | 1023104432431 |
11 | 364994863a54 |
12 | 14634b7303a7 |
13 | 7562ab90b33 |
14 | 37738b5b78b |
15 | 1b92ed040c1 |
hex | ee35c6b92f |
1023104432431 has 2 divisors, whose sum is σ = 1023104432432. Its totient is φ = 1023104432430.
The previous prime is 1023104432429. The next prime is 1023104432461. The reversal of 1023104432431 is 1342344013201.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1023104432431 - 21 = 1023104432429 is a prime.
It is a super-2 number, since 2×10231044324312 (a number of 25 digits) contains 22 as substring.
Together with 1023104432429, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 1023104432431.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1023104432461) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 511552216215 + 511552216216.
It is an arithmetic number, because the mean of its divisors is an integer number (511552216216).
Almost surely, 21023104432431 is an apocalyptic number.
1023104432431 is a deficient number, since it is larger than the sum of its proper divisors (1).
1023104432431 is an equidigital number, since it uses as much as digits as its factorization.
1023104432431 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6912, while the sum is 28.
Adding to 1023104432431 its reverse (1342344013201), we get a palindrome (2365448445632).
The spelling of 1023104432431 in words is "one trillion, twenty-three billion, one hundred four million, four hundred thirty-two thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •