Base | Representation |
---|---|
bin | 1001001101101001111100… |
… | …0010001011011001101001 |
3 | 1022212102211010102222220211 |
4 | 2103122133002023121221 |
5 | 2311433122431013142 |
6 | 33313430005021121 |
7 | 2063611553015533 |
oct | 223323702133151 |
9 | 38772733388824 |
10 | 10130201032297 |
11 | 3256215430745 |
12 | 11773739b47a1 |
13 | 586373889178 |
14 | 2704391a8853 |
15 | 12879a766917 |
hex | 9369f08b669 |
10130201032297 has 2 divisors, whose sum is σ = 10130201032298. Its totient is φ = 10130201032296.
The previous prime is 10130201032253. The next prime is 10130201032313. The reversal of 10130201032297 is 79223010203101.
10130201032297 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9322402734121 + 807798298176 = 3053261^2 + 898776^2 .
It is a cyclic number.
It is not a de Polignac number, because 10130201032297 - 211 = 10130201030249 is a prime.
It is not a weakly prime, because it can be changed into another prime (10130201032097) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5065100516148 + 5065100516149.
It is an arithmetic number, because the mean of its divisors is an integer number (5065100516149).
Almost surely, 210130201032297 is an apocalyptic number.
It is an amenable number.
10130201032297 is a deficient number, since it is larger than the sum of its proper divisors (1).
10130201032297 is an equidigital number, since it uses as much as digits as its factorization.
10130201032297 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4536, while the sum is 31.
Adding to 10130201032297 its reverse (79223010203101), we get a palindrome (89353211235398).
The spelling of 10130201032297 in words is "ten trillion, one hundred thirty billion, two hundred one million, thirty-two thousand, two hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •