Base | Representation |
---|---|
bin | 11011000001010011… |
… | …10000010111100001 |
3 | 1101102222110112222001 |
4 | 31200221300113201 |
5 | 214202123220031 |
6 | 10355243444001 |
7 | 1022324611111 |
oct | 154051602741 |
9 | 41388415861 |
10 | 14506460641 |
11 | 6174578652 |
12 | 298a226601 |
13 | 14a251682a |
14 | 9b8871041 |
15 | 59d825861 |
hex | 360a705e1 |
14506460641 has 2 divisors, whose sum is σ = 14506460642. Its totient is φ = 14506460640.
The previous prime is 14506460629. The next prime is 14506460681. The reversal of 14506460641 is 14606460541.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9249630625 + 5256830016 = 96175^2 + 72504^2 .
It is a cyclic number.
It is not a de Polignac number, because 14506460641 - 25 = 14506460609 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 14506460641.
It is not a weakly prime, because it can be changed into another prime (14506460681) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7253230320 + 7253230321.
It is an arithmetic number, because the mean of its divisors is an integer number (7253230321).
Almost surely, 214506460641 is an apocalyptic number.
It is an amenable number.
14506460641 is a deficient number, since it is larger than the sum of its proper divisors (1).
14506460641 is an equidigital number, since it uses as much as digits as its factorization.
14506460641 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 69120, while the sum is 37.
The spelling of 14506460641 in words is "fourteen billion, five hundred six million, four hundred sixty thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.389 sec. • engine limits •