Base | Representation |
---|---|
bin | 1001001011111111001010… |
… | …1110010001111100100101 |
3 | 1022202200211201021112101112 |
4 | 2102333302232101330211 |
5 | 2311000423311100201 |
6 | 33252330014434405 |
7 | 2061545405045516 |
oct | 222776256217445 |
9 | 38680751245345 |
10 | 10101540331301 |
11 | 32450481968a1 |
12 | 11718b5502a05 |
13 | 583756b0b7b3 |
14 | 26ccba990a0d |
15 | 127b6e4e20bb |
hex | 92ff2b91f25 |
10101540331301 has 2 divisors, whose sum is σ = 10101540331302. Its totient is φ = 10101540331300.
The previous prime is 10101540331279. The next prime is 10101540331357. The reversal of 10101540331301 is 10313304510101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8365341444100 + 1736198887201 = 2892290^2 + 1317649^2 .
It is a cyclic number.
It is not a de Polignac number, because 10101540331301 - 226 = 10101473222437 is a prime.
It is a super-2 number, since 2×101015403313012 (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 (10101540331381) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5050770165650 + 5050770165651.
It is an arithmetic number, because the mean of its divisors is an integer number (5050770165651).
Almost surely, 210101540331301 is an apocalyptic number.
It is an amenable number.
10101540331301 is a deficient number, since it is larger than the sum of its proper divisors (1).
10101540331301 is an equidigital number, since it uses as much as digits as its factorization.
10101540331301 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 540, while the sum is 23.
Adding to 10101540331301 its reverse (10313304510101), we get a palindrome (20414844841402).
The spelling of 10101540331301 in words is "ten trillion, one hundred one billion, five hundred forty million, three hundred thirty-one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •