Base | Representation |
---|---|
bin | 11000011011010101… |
… | …00011111100010111 |
3 | 1020211221121111121112 |
4 | 30031222203330113 |
5 | 203324211203332 |
6 | 10005150005235 |
7 | 642660355163 |
oct | 141552437427 |
9 | 36757544545 |
10 | 13114162967 |
11 | 561a66a814 |
12 | 265baa681b |
13 | 130cc33b59 |
14 | 8c59a5ca3 |
15 | 51b4a2db2 |
hex | 30daa3f17 |
13114162967 has 4 divisors (see below), whose sum is σ = 13885584336. Its totient is φ = 12342741600.
The previous prime is 13114162951. The next prime is 13114162979. The reversal of 13114162967 is 76926141131.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 76926141131 = 7 ⋅10989448733.
It is a cyclic number.
It is not a de Polignac number, because 13114162967 - 24 = 13114162951 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13114162937) 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 in 3 ways as a sum of consecutive naturals, for example, 385710659 + ... + 385710692.
It is an arithmetic number, because the mean of its divisors is an integer number (3471396084).
Almost surely, 213114162967 is an apocalyptic number.
13114162967 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
13114162967 is a deficient number, since it is larger than the sum of its proper divisors (771421369).
13114162967 is an equidigital number, since it uses as much as digits as its factorization.
13114162967 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 771421368.
The product of its digits is 54432, while the sum is 41.
The spelling of 13114162967 in words is "thirteen billion, one hundred fourteen million, one hundred sixty-two thousand, nine hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •