Base | Representation |
---|---|
bin | 1110000010100011001… |
… | …1010011011111100001 |
3 | 212001120211110001000102 |
4 | 3200220303103133201 |
5 | 12422440343101101 |
6 | 302450151032145 |
7 | 23266141114316 |
oct | 3405063233741 |
9 | 761524401012 |
10 | 241202706401 |
11 | 93325704378 |
12 | 3a8b636b655 |
13 | 1998c602a17 |
14 | b9622c4d0d |
15 | 641a82d86b |
hex | 3828cd37e1 |
241202706401 has 2 divisors, whose sum is σ = 241202706402. Its totient is φ = 241202706400.
The previous prime is 241202706397. The next prime is 241202706421. The reversal of 241202706401 is 104607202142.
241202706401 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 198260920225 + 42941786176 = 445265^2 + 207224^2 .
It is a cyclic number.
It is not a de Polignac number, because 241202706401 - 22 = 241202706397 is a prime.
It is not a weakly prime, because it can be changed into another prime (241202706421) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 120601353200 + 120601353201.
It is an arithmetic number, because the mean of its divisors is an integer number (120601353201).
Almost surely, 2241202706401 is an apocalyptic number.
It is an amenable number.
241202706401 is a deficient number, since it is larger than the sum of its proper divisors (1).
241202706401 is an equidigital number, since it uses as much as digits as its factorization.
241202706401 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5376, while the sum is 29.
Adding to 241202706401 its reverse (104607202142), we get a palindrome (345809908543).
The spelling of 241202706401 in words is "two hundred forty-one billion, two hundred two million, seven hundred six thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •