Base | Representation |
---|---|
bin | 1001011101100110000000… |
… | …0111000000101001010101 |
3 | 1100211121121021020110100021 |
4 | 2113121200013000221111 |
5 | 2330424414422210201 |
6 | 34043313045145141 |
7 | 2122444252260634 |
oct | 227314007005125 |
9 | 40747537213307 |
10 | 10404023241301 |
11 | 3351359984128 |
12 | 12004523bb1b1 |
13 | 5a6131164b01 |
14 | 27d7b377551b |
15 | 130974b52ea1 |
hex | 976601c0a55 |
10404023241301 has 2 divisors, whose sum is σ = 10404023241302. Its totient is φ = 10404023241300.
The previous prime is 10404023241257. The next prime is 10404023241323. The reversal of 10404023241301 is 10314232040401.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8592818685201 + 1811204556100 = 2931351^2 + 1345810^2 .
It is an emirp because it is prime and its reverse (10314232040401) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10404023241301 - 215 = 10404023208533 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10404023241331) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5202011620650 + 5202011620651.
It is an arithmetic number, because the mean of its divisors is an integer number (5202011620651).
Almost surely, 210404023241301 is an apocalyptic number.
It is an amenable number.
10404023241301 is a deficient number, since it is larger than the sum of its proper divisors (1).
10404023241301 is an equidigital number, since it uses as much as digits as its factorization.
10404023241301 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 10404023241301 its reverse (10314232040401), we get a palindrome (20718255281702).
The spelling of 10404023241301 in words is "ten trillion, four hundred four billion, twenty-three million, two hundred forty-one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •