Base | Representation |
---|---|
bin | 110100111000000010001110… |
… | …1111000010011010011111000 |
3 | 2020222202221210021021022021210 |
4 | 1221300010131320103103320 |
5 | 441430132120443034333 |
6 | 4325103100434203120 |
7 | 166652144223656520 |
oct | 15160043570232370 |
9 | 2228687707238253 |
10 | 465098214814968 |
11 | 1252160551a5429 |
12 | 441b71971234a0 |
13 | 16c6975bb99217 |
14 | 82bcc3364a680 |
15 | 38b8412a5da63 |
hex | 1a7011de134f8 |
465098214814968 has 32 divisors (see below), whose sum is σ = 1328852042328960. Its totient is φ = 132885204232800.
The previous prime is 465098214814943. The next prime is 465098214815011. The reversal of 465098214814968 is 869418412890564.
It is a self number, because there is not a number n which added to its sum of digits gives 465098214814968.
It is a congruent number.
It is an unprimeable number.
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 in 7 ways as a sum of consecutive naturals, for example, 1384220877258 + ... + 1384220877593.
It is an arithmetic number, because the mean of its divisors is an integer number (41526626322780).
Almost surely, 2465098214814968 is an apocalyptic number.
It is an amenable number.
465098214814968 is an abundant number, since it is smaller than the sum of its proper divisors (863753827513992).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
465098214814968 is a wasteful number, since it uses less digits than its factorization.
465098214814968 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2768441754867 (or 2768441754863 counting only the distinct ones).
The product of its (nonzero) digits is 955514880, while the sum is 75.
The spelling of 465098214814968 in words is "four hundred sixty-five trillion, ninety-eight billion, two hundred fourteen million, eight hundred fourteen thousand, nine hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •