Base | Representation |
---|---|
bin | 111110110100100010… |
… | …1010100111101000001 |
3 | 110220012220022012000001 |
4 | 1331221011110331001 |
5 | 4202242142143101 |
6 | 141550405000001 |
7 | 12514056332551 |
oct | 1755105247501 |
9 | 426186265001 |
10 | 134906990401 |
11 | 5223952a6a7 |
12 | 221900b3001 |
13 | c94c699651 |
14 | 675b079161 |
15 | 3798a46901 |
hex | 1f69154f41 |
134906990401 has 2 divisors, whose sum is σ = 134906990402. Its totient is φ = 134906990400.
The previous prime is 134906990371. The next prime is 134906990419. The reversal of 134906990401 is 104099609431.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 101220058801 + 33686931600 = 318151^2 + 183540^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-134906990401 is a prime.
It is a super-2 number, since 2×1349069904012 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (134906990501) 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, 67453495200 + 67453495201.
It is an arithmetic number, because the mean of its divisors is an integer number (67453495201).
Almost surely, 2134906990401 is an apocalyptic number.
It is an amenable number.
134906990401 is a deficient number, since it is larger than the sum of its proper divisors (1).
134906990401 is an equidigital number, since it uses as much as digits as its factorization.
134906990401 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 209952, while the sum is 46.
The spelling of 134906990401 in words is "one hundred thirty-four billion, nine hundred six million, nine hundred ninety thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •