Base | Representation |
---|---|
bin | 11010100010010001… |
… | …11110101110001001 |
3 | 1100202211202110210202 |
4 | 31101020332232021 |
5 | 213134012213231 |
6 | 10313345421545 |
7 | 1013014535141 |
oct | 152110765611 |
9 | 40684673722 |
10 | 14246210441 |
11 | 6050683841 |
12 | 291703a8b5 |
13 | 1460625728 |
14 | 992087921 |
15 | 585a695cb |
hex | 35123eb89 |
14246210441 has 2 divisors, whose sum is σ = 14246210442. Its totient is φ = 14246210440.
The previous prime is 14246210437. The next prime is 14246210449. The reversal of 14246210441 is 14401264241.
14246210441 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., 13760228416 + 485982025 = 117304^2 + 22045^2 .
It is a cyclic number.
It is not a de Polignac number, because 14246210441 - 22 = 14246210437 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (14246210449) 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, 7123105220 + 7123105221.
It is an arithmetic number, because the mean of its divisors is an integer number (7123105221).
Almost surely, 214246210441 is an apocalyptic number.
It is an amenable number.
14246210441 is a deficient number, since it is larger than the sum of its proper divisors (1).
14246210441 is an equidigital number, since it uses as much as digits as its factorization.
14246210441 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6144, while the sum is 29.
Adding to 14246210441 its reverse (14401264241), we get a palindrome (28647474682).
The spelling of 14246210441 in words is "fourteen billion, two hundred forty-six million, two hundred ten thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •