Base | Representation |
---|---|
bin | 101000111110110110001… |
… | …1010100100101100000001 |
3 | 201221110112002000200211212 |
4 | 1101331230122210230001 |
5 | 1214240400340433101 |
6 | 15551313333215505 |
7 | 1120636056544646 |
oct | 121755432445401 |
9 | 21843462020755 |
10 | 5632521030401 |
11 | 1881814311591 |
12 | 76b753a91595 |
13 | 31b1b549a415 |
14 | 156888bdbdcd |
15 | 9b7ac69a1bb |
hex | 51f6c6a4b01 |
5632521030401 has 2 divisors, whose sum is σ = 5632521030402. Its totient is φ = 5632521030400.
The previous prime is 5632521030379. The next prime is 5632521030407. The reversal of 5632521030401 is 1040301252365.
It is a happy number.
5632521030401 is digitally balanced in base 3, 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., 4895067750400 + 737453280001 = 2212480^2 + 858751^2 .
It is a cyclic number.
It is not a de Polignac number, because 5632521030401 - 26 = 5632521030337 is a prime.
It is not a weakly prime, because it can be changed into another prime (5632521030407) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2816260515200 + 2816260515201.
It is an arithmetic number, because the mean of its divisors is an integer number (2816260515201).
Almost surely, 25632521030401 is an apocalyptic number.
It is an amenable number.
5632521030401 is a deficient number, since it is larger than the sum of its proper divisors (1).
5632521030401 is an equidigital number, since it uses as much as digits as its factorization.
5632521030401 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 21600, while the sum is 32.
Adding to 5632521030401 its reverse (1040301252365), we get a palindrome (6672822282766).
The spelling of 5632521030401 in words is "five trillion, six hundred thirty-two billion, five hundred twenty-one million, thirty thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •