Base | Representation |
---|---|
bin | 100001000110111010000000… |
… | …000100110100101011001001 |
3 | 201002120012012022121220101021 |
4 | 201012322000010310223021 |
5 | 123041134021241020334 |
6 | 1233404211551152441 |
7 | 42445661522442352 |
oct | 4106720004645311 |
9 | 632505168556337 |
10 | 145610130016969 |
11 | 42439a00389a52 |
12 | 143b8275b15721 |
13 | 6332c90042a37 |
14 | 27d57d4442d29 |
15 | 11c79c106c3b4 |
hex | 846e80134ac9 |
145610130016969 has 2 divisors, whose sum is σ = 145610130016970. Its totient is φ = 145610130016968.
The previous prime is 145610130016927. The next prime is 145610130016979. The reversal of 145610130016969 is 969610031016541.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 137971335054400 + 7638794962569 = 11746120^2 + 2763837^2 .
It is a cyclic number.
It is not a de Polignac number, because 145610130016969 - 217 = 145610129885897 is a prime.
It is a super-3 number, since 3×1456101300169693 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not a weakly prime, because it can be changed into another prime (145610130016919) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72805065008484 + 72805065008485.
It is an arithmetic number, because the mean of its divisors is an integer number (72805065008485).
Almost surely, 2145610130016969 is an apocalyptic number.
It is an amenable number.
145610130016969 is a deficient number, since it is larger than the sum of its proper divisors (1).
145610130016969 is an equidigital number, since it uses as much as digits as its factorization.
145610130016969 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1049760, while the sum is 52.
The spelling of 145610130016969 in words is "one hundred forty-five trillion, six hundred ten billion, one hundred thirty million, sixteen thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •