Base | Representation |
---|---|
bin | 1100111011000111100010… |
… | …11111010001011000101001 |
3 | 10201121212211122212011112121 |
4 | 12131203301133101120221 |
5 | 12211111222103341230 |
6 | 140235432520511241 |
7 | 5662150032613441 |
oct | 635436137213051 |
9 | 121555748764477 |
10 | 28419555137065 |
11 | 9067735a84574 |
12 | 322ba9761b521 |
13 | 12b1c4c9a2441 |
14 | 703729c63121 |
15 | 3443d038977a |
hex | 19d8f17d1629 |
28419555137065 has 32 divisors (see below), whose sum is σ = 34912018344960. Its totient is φ = 22198970572800.
The previous prime is 28419555137047. The next prime is 28419555137101. The reversal of 28419555137065 is 56073155591482.
It is not a de Polignac number, because 28419555137065 - 213 = 28419555128873 is a prime.
It is a super-2 number, since 2×284195551370652 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 28419555136994 and 28419555137012.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 185053660 + ... + 185207170.
It is an arithmetic number, because the mean of its divisors is an integer number (1091000573280).
It is a 2-persistent number, because it is pandigital, and so is 2⋅28419555137065 = 56839110274130, but 3⋅28419555137065 = 85258665411195 is not.
Almost surely, 228419555137065 is an apocalyptic number.
It is an amenable number.
28419555137065 is a deficient number, since it is larger than the sum of its proper divisors (6492463207895).
28419555137065 is a wasteful number, since it uses less digits than its factorization.
28419555137065 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 155433.
The product of its (nonzero) digits is 45360000, while the sum is 61.
The spelling of 28419555137065 in words is "twenty-eight trillion, four hundred nineteen billion, five hundred fifty-five million, one hundred thirty-seven thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •