Base | Representation |
---|---|
bin | 111110101000110111… |
… | …1011111011111100111 |
3 | 110212012121102211211202 |
4 | 1331101233133133213 |
5 | 4200441414443224 |
6 | 141443455353115 |
7 | 12501262644653 |
oct | 1752157373747 |
9 | 425177384752 |
10 | 134515390439 |
11 | 52058481871 |
12 | 220a0b2279b |
13 | c8b95095b1 |
14 | 672105da63 |
15 | 3774491eae |
hex | 1f51bdf7e7 |
134515390439 has 2 divisors, whose sum is σ = 134515390440. Its totient is φ = 134515390438.
The previous prime is 134515390397. The next prime is 134515390487. The reversal of 134515390439 is 934093515431.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-134515390439 is a prime.
It is a super-2 number, since 2×1345153904392 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 134515390393 and 134515390402.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (134515390039) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 67257695219 + 67257695220.
It is an arithmetic number, because the mean of its divisors is an integer number (67257695220).
Almost surely, 2134515390439 is an apocalyptic number.
134515390439 is a deficient number, since it is larger than the sum of its proper divisors (1).
134515390439 is an equidigital number, since it uses as much as digits as its factorization.
134515390439 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 874800, while the sum is 47.
The spelling of 134515390439 in words is "one hundred thirty-four billion, five hundred fifteen million, three hundred ninety thousand, four hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •