Base | Representation |
---|---|
bin | 1010101001000011110100… |
… | …10101101001100111011001 |
3 | 10001212010011022120021111022 |
4 | 11110201322111221213121 |
5 | 11031400304241340231 |
6 | 121434141535012225 |
7 | 4633445305550114 |
oct | 524417225514731 |
9 | 101763138507438 |
10 | 23401034324441 |
11 | 75023608a33a4 |
12 | 275b33b06a075 |
13 | 1009928819567 |
14 | 5ac88a83b57b |
15 | 2a8aabbd4c7b |
hex | 15487a5699d9 |
23401034324441 has 2 divisors, whose sum is σ = 23401034324442. Its totient is φ = 23401034324440.
The previous prime is 23401034324429. The next prime is 23401034324461. The reversal of 23401034324441 is 14442343010432.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11941482366025 + 11459551958416 = 3455645^2 + 3385196^2 .
It is a cyclic number.
It is not a de Polignac number, because 23401034324441 - 230 = 23399960582617 is a prime.
It is not a weakly prime, because it can be changed into another prime (23401034324461) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11700517162220 + 11700517162221.
It is an arithmetic number, because the mean of its divisors is an integer number (11700517162221).
Almost surely, 223401034324441 is an apocalyptic number.
It is an amenable number.
23401034324441 is a deficient number, since it is larger than the sum of its proper divisors (1).
23401034324441 is an equidigital number, since it uses as much as digits as its factorization.
23401034324441 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 110592, while the sum is 35.
Adding to 23401034324441 its reverse (14442343010432), we get a palindrome (37843377334873).
The spelling of 23401034324441 in words is "twenty-three trillion, four hundred one billion, thirty-four million, three hundred twenty-four thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •