Base | Representation |
---|---|
bin | 1101011010001000011001… |
… | …0111000101111010101011 |
3 | 1221012101011212220001202112 |
4 | 3112202012113011322223 |
5 | 3413020301440212423 |
6 | 51204352035352535 |
7 | 3051054632023115 |
oct | 326420627057253 |
9 | 57171155801675 |
10 | 14742581960363 |
11 | 47743261a6364 |
12 | 17a1264a5274b |
13 | 82c2b136b32a |
14 | 38d78ac083b5 |
15 | 1a874d4a7a78 |
hex | d68865c5eab |
14742581960363 has 2 divisors, whose sum is σ = 14742581960364. Its totient is φ = 14742581960362.
The previous prime is 14742581960297. The next prime is 14742581960437. The reversal of 14742581960363 is 36306918524741.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 14742581960363 - 224 = 14742565183147 is a prime.
It is a super-2 number, since 2×147425819603632 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (14742581990363) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7371290980181 + 7371290980182.
It is an arithmetic number, because the mean of its divisors is an integer number (7371290980182).
It is a 2-persistent number, because it is pandigital, and so is 2⋅14742581960363 = 29485163920726, but 3⋅14742581960363 = 44227745881089 is not.
Almost surely, 214742581960363 is an apocalyptic number.
14742581960363 is a deficient number, since it is larger than the sum of its proper divisors (1).
14742581960363 is an equidigital number, since it uses as much as digits as its factorization.
14742581960363 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 26127360, while the sum is 59.
The spelling of 14742581960363 in words is "fourteen trillion, seven hundred forty-two billion, five hundred eighty-one million, nine hundred sixty thousand, three hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •