Base | Representation |
---|---|
bin | 11011110011001111… |
… | …10011100000101111 |
3 | 1102112011201211210012 |
4 | 31321213303200233 |
5 | 221031344122011 |
6 | 10505010403435 |
7 | 1035602430221 |
oct | 157147634057 |
9 | 42464654705 |
10 | 14925379631 |
11 | 6369a95698 |
12 | 2a8659057b |
13 | 153b2504a6 |
14 | a1835c411 |
15 | 5c54c4a8b |
hex | 3799f382f |
14925379631 has 2 divisors, whose sum is σ = 14925379632. Its totient is φ = 14925379630.
The previous prime is 14925379561. The next prime is 14925379639. The reversal of 14925379631 is 13697352941.
It is a strong prime.
It is an emirp because it is prime and its reverse (13697352941) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 14925379631 - 214 = 14925363247 is a prime.
It is a super-2 number, since 2×149253796312 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 14925379631.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14925379639) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7462689815 + 7462689816.
It is an arithmetic number, because the mean of its divisors is an integer number (7462689816).
Almost surely, 214925379631 is an apocalyptic number.
14925379631 is a deficient number, since it is larger than the sum of its proper divisors (1).
14925379631 is an equidigital number, since it uses as much as digits as its factorization.
14925379631 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1224720, while the sum is 50.
The spelling of 14925379631 in words is "fourteen billion, nine hundred twenty-five million, three hundred seventy-nine thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •