Base | Representation |
---|---|
bin | 10111010010000111100111… |
… | …100011110100101000000111 |
3 | 111102120100211000111120010112 |
4 | 113102013213203310220013 |
5 | 101410211102224401211 |
6 | 1001442000315343235 |
7 | 30366112264401404 |
oct | 2722074743645007 |
9 | 442510730446115 |
10 | 102400200231431 |
11 | 2a69a754510183 |
12 | b599a17a51b1b |
13 | 451a3b365408b |
14 | 1b402a62a72ab |
15 | bc89e6a4888b |
hex | 5d21e78f4a07 |
102400200231431 has 2 divisors, whose sum is σ = 102400200231432. Its totient is φ = 102400200231430.
The previous prime is 102400200231419. The next prime is 102400200231449. The reversal of 102400200231431 is 134132002004201.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102400200231431 is a prime.
It is a super-2 number, since 2×1024002002314312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 102400200231397 and 102400200231406.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102400200239431) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51200100115715 + 51200100115716.
It is an arithmetic number, because the mean of its divisors is an integer number (51200100115716).
Almost surely, 2102400200231431 is an apocalyptic number.
102400200231431 is a deficient number, since it is larger than the sum of its proper divisors (1).
102400200231431 is an equidigital number, since it uses as much as digits as its factorization.
102400200231431 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 102400200231431 its reverse (134132002004201), we get a palindrome (236532202235632).
The spelling of 102400200231431 in words is "one hundred two trillion, four hundred billion, two hundred million, two hundred thirty-one thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •