Base | Representation |
---|---|
bin | 11011010111100111… |
… | …11010000011011101 |
3 | 1101221000201211110222 |
4 | 31223303322003131 |
5 | 220043034434013 |
6 | 10430012211125 |
7 | 1030060100231 |
oct | 155363720335 |
9 | 41830654428 |
10 | 14693671133 |
11 | 6260215669 |
12 | 2a20a69aa5 |
13 | 150224367b |
14 | 9d56845c1 |
15 | 5aeea5508 |
hex | 36bcfa0dd |
14693671133 has 2 divisors, whose sum is σ = 14693671134. Its totient is φ = 14693671132.
The previous prime is 14693671099. The next prime is 14693671151. The reversal of 14693671133 is 33117639641.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13032048964 + 1661622169 = 114158^2 + 40763^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14693671133 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14693671163) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7346835566 + 7346835567.
It is an arithmetic number, because the mean of its divisors is an integer number (7346835567).
Almost surely, 214693671133 is an apocalyptic number.
It is an amenable number.
14693671133 is a deficient number, since it is larger than the sum of its proper divisors (1).
14693671133 is an equidigital number, since it uses as much as digits as its factorization.
14693671133 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 244944, while the sum is 44.
The spelling of 14693671133 in words is "fourteen billion, six hundred ninety-three million, six hundred seventy-one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •