Base | Representation |
---|---|
bin | 11011001100011101… |
… | …00101010010000001 |
3 | 1101200111110212201111 |
4 | 31212032211102001 |
5 | 214400100010031 |
6 | 10412424403321 |
7 | 1024541646352 |
oct | 154616452201 |
9 | 41614425644 |
10 | 14600000641 |
11 | 6212357636 |
12 | 29b5616541 |
13 | 14b8a07b45 |
14 | 9c705dd29 |
15 | 5a6b511b1 |
hex | 3663a5481 |
14600000641 has 2 divisors, whose sum is σ = 14600000642. Its totient is φ = 14600000640.
The previous prime is 14600000633. The next prime is 14600000663.
14600000641 is nontrivially palindromic in base 10.
It is an a-pointer prime, because the next prime (14600000663) can be obtained adding 14600000641 to its sum of digits (22).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 14300572225 + 299428416 = 119585^2 + 17304^2 .
It is a palprime.
It is a cyclic number.
It is not a de Polignac number, because 14600000641 - 23 = 14600000633 is a prime.
It is not a weakly prime, because it can be changed into another prime (14600004641) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7300000320 + 7300000321.
It is an arithmetic number, because the mean of its divisors is an integer number (7300000321).
Almost surely, 214600000641 is an apocalyptic number.
It is an amenable number.
14600000641 is a deficient number, since it is larger than the sum of its proper divisors (1).
14600000641 is an equidigital number, since it uses as much as digits as its factorization.
14600000641 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576, while the sum is 22.
It can be divided in two parts, 14600000 and 641, that added together give a palindrome (14600641).
The spelling of 14600000641 in words is "fourteen billion, six hundred million, six hundred forty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •