Base | Representation |
---|---|
bin | 11011010111100100… |
… | …01110001110010101 |
3 | 1101220222220101121202 |
4 | 31223302032032111 |
5 | 220042431320321 |
6 | 10425554522245 |
7 | 1030053250451 |
oct | 155362161625 |
9 | 41828811552 |
10 | 14693229461 |
11 | 625aa43849 |
12 | 2a20896385 |
13 | 150211a621 |
14 | 9d55ab661 |
15 | 5aee1970b |
hex | 36bc8e395 |
14693229461 has 2 divisors, whose sum is σ = 14693229462. Its totient is φ = 14693229460.
The previous prime is 14693229457. The next prime is 14693229487. The reversal of 14693229461 is 16492239641.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9376048900 + 5317180561 = 96830^2 + 72919^2 .
It is an emirp because it is prime and its reverse (16492239641) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 14693229461 - 22 = 14693229457 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14693229361) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7346614730 + 7346614731.
It is an arithmetic number, because the mean of its divisors is an integer number (7346614731).
Almost surely, 214693229461 is an apocalyptic number.
It is an amenable number.
14693229461 is a deficient number, since it is larger than the sum of its proper divisors (1).
14693229461 is an equidigital number, since it uses as much as digits as its factorization.
14693229461 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 559872, while the sum is 47.
The spelling of 14693229461 in words is "fourteen billion, six hundred ninety-three million, two hundred twenty-nine thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •