Base | Representation |
---|---|
bin | 100010011010011000010100… |
… | …011011110111100111100101 |
3 | 201211212120111212102010200101 |
4 | 202122120110123313213211 |
5 | 124314124412002121334 |
6 | 1253515324305544101 |
7 | 43610262614433253 |
oct | 4232302433674745 |
9 | 654776455363611 |
10 | 151346400426469 |
11 | 442507144a2646 |
12 | 14b83b43345031 |
13 | 665ab9aa420b1 |
14 | 29532c22175d3 |
15 | 1276d01bbe214 |
hex | 89a6146f79e5 |
151346400426469 has 2 divisors, whose sum is σ = 151346400426470. Its totient is φ = 151346400426468.
The previous prime is 151346400426457. The next prime is 151346400426521. The reversal of 151346400426469 is 964624004643151.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 108668428092225 + 42677972334244 = 10424415^2 + 6532838^2 .
It is a cyclic number.
It is not a de Polignac number, because 151346400426469 - 221 = 151346398329317 is a prime.
It is a super-2 number, since 2×1513464004264692 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (151346400426449) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 75673200213234 + 75673200213235.
It is an arithmetic number, because the mean of its divisors is an integer number (75673200213235).
Almost surely, 2151346400426469 is an apocalyptic number.
It is an amenable number.
151346400426469 is a deficient number, since it is larger than the sum of its proper divisors (1).
151346400426469 is an equidigital number, since it uses as much as digits as its factorization.
151346400426469 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 14929920, while the sum is 55.
The spelling of 151346400426469 in words is "one hundred fifty-one trillion, three hundred forty-six billion, four hundred million, four hundred twenty-six thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •