Base | Representation |
---|---|
bin | 11000010000011001… |
… | …01010111110111001 |
3 | 1020121120000120021111 |
4 | 30020030222332321 |
5 | 203132221111101 |
6 | 5552112040321 |
7 | 640464632314 |
oct | 141014527671 |
9 | 36546016244 |
10 | 13022441401 |
11 | 5582912a72 |
12 | 26352330a1 |
13 | 12c6c2b438 |
14 | 8b772b97b |
15 | 5133d6251 |
hex | 30832afb9 |
13022441401 has 2 divisors, whose sum is σ = 13022441402. Its totient is φ = 13022441400.
The previous prime is 13022441353. The next prime is 13022441413. The reversal of 13022441401 is 10414422031.
It is a happy number.
13022441401 is digitally balanced in base 2, 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., 12569773225 + 452668176 = 112115^2 + 21276^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13022441401 is a prime.
It is not a weakly prime, because it can be changed into another prime (13022441501) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6511220700 + 6511220701.
It is an arithmetic number, because the mean of its divisors is an integer number (6511220701).
Almost surely, 213022441401 is an apocalyptic number.
It is an amenable number.
13022441401 is a deficient number, since it is larger than the sum of its proper divisors (1).
13022441401 is an equidigital number, since it uses as much as digits as its factorization.
13022441401 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 768, while the sum is 22.
Adding to 13022441401 its reverse (10414422031), we get a palindrome (23436863432).
The spelling of 13022441401 in words is "thirteen billion, twenty-two million, four hundred forty-one thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •