Base | Representation |
---|---|
bin | 1001011101011111100101… |
… | …1010001011110001101101 |
3 | 1100211110011012001121202102 |
4 | 2113113321122023301231 |
5 | 2330412402323330011 |
6 | 34042430054504445 |
7 | 2122353460631555 |
oct | 227277132136155 |
9 | 40743135047672 |
10 | 10402300214381 |
11 | 3350655313539 |
12 | 1200051365125 |
13 | 5a5c181b545a |
14 | 27d68c9b8165 |
15 | 1308c375173b |
hex | 975f968bc6d |
10402300214381 has 2 divisors, whose sum is σ = 10402300214382. Its totient is φ = 10402300214380.
The previous prime is 10402300214377. The next prime is 10402300214473. The reversal of 10402300214381 is 18341200320401.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8944705192900 + 1457595021481 = 2990770^2 + 1207309^2 .
It is a cyclic number.
It is not a de Polignac number, because 10402300214381 - 22 = 10402300214377 is a prime.
It is a super-2 number, since 2×104023002143812 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10402300214311) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5201150107190 + 5201150107191.
It is an arithmetic number, because the mean of its divisors is an integer number (5201150107191).
Almost surely, 210402300214381 is an apocalyptic number.
It is an amenable number.
10402300214381 is a deficient number, since it is larger than the sum of its proper divisors (1).
10402300214381 is an equidigital number, since it uses as much as digits as its factorization.
10402300214381 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4608, while the sum is 29.
Adding to 10402300214381 its reverse (18341200320401), we get a palindrome (28743500534782).
The spelling of 10402300214381 in words is "ten trillion, four hundred two billion, three hundred million, two hundred fourteen thousand, three hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •