Base | Representation |
---|---|
bin | 1001010111100111011111… |
… | …0110011011001001011001 |
3 | 1100110210120020222210012021 |
4 | 2111321313312123021121 |
5 | 2322234122114101411 |
6 | 33524212113014441 |
7 | 2112150603035545 |
oct | 225716766331131 |
9 | 40423506883167 |
10 | 10301342331481 |
11 | 3311858210883 |
12 | 11a4576854421 |
13 | 5995490c3bc6 |
14 | 278832650a25 |
15 | 12ce653a4a71 |
hex | 95e77d9b259 |
10301342331481 has 2 divisors, whose sum is σ = 10301342331482. Its totient is φ = 10301342331480.
The previous prime is 10301342331457. The next prime is 10301342331491. The reversal of 10301342331481 is 18413324310301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9406587144256 + 894755187225 = 3067016^2 + 945915^2 .
It is a cyclic number.
It is not a de Polignac number, because 10301342331481 - 227 = 10301208113753 is a prime.
It is a super-2 number, since 2×103013423314812 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10301342331491) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5150671165740 + 5150671165741.
It is an arithmetic number, because the mean of its divisors is an integer number (5150671165741).
Almost surely, 210301342331481 is an apocalyptic number.
It is an amenable number.
10301342331481 is a deficient number, since it is larger than the sum of its proper divisors (1).
10301342331481 is an equidigital number, since it uses as much as digits as its factorization.
10301342331481 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 20736, while the sum is 34.
Adding to 10301342331481 its reverse (18413324310301), we get a palindrome (28714666641782).
The spelling of 10301342331481 in words is "ten trillion, three hundred one billion, three hundred forty-two million, three hundred thirty-one thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •