Base | Representation |
---|---|
bin | 100101100010101000101… |
… | …1011110010000110010010 |
3 | 200021020212220222212010200 |
4 | 1023011101123302012102 |
5 | 1134013401210210312 |
6 | 14550144141040030 |
7 | 1041525146015142 |
oct | 113052133620622 |
9 | 20236786885120 |
10 | 5159621960082 |
11 | 170a2020a3737 |
12 | 6b3b76b56016 |
13 | 2b571cc0ac15 |
14 | 13ba26db0922 |
15 | 8e330dd70dc |
hex | 4b1516f2192 |
5159621960082 has 54 divisors (see below), whose sum is σ = 11446127227431. Its totient is φ = 1679741998200.
The previous prime is 5159621960063. The next prime is 5159621960107. The reversal of 5159621960082 is 2800691269515.
5159621960082 is a `hidden beast` number, since 5 + 1 + 5 + 9 + 6 + 21 + 9 + 600 + 8 + 2 = 666.
It can be written as a sum of positive squares in only one way, i.e., 2579810980041 + 2579810980041 = 1606179^2 + 1606179^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=1606179.
It is a super-3 number, since 3×51596219600823 (a number of 39 digits) contains 333 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 414387957 + ... + 414400407.
Almost surely, 25159621960082 is an apocalyptic number.
5159621960082 is an abundant number, since it is smaller than the sum of its proper divisors (6286505267349).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5159621960082 is an frugal number, since it uses more digits than its factorization.
5159621960082 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24996 (or 12499 counting only the distinct ones).
The product of its (nonzero) digits is 2332800, while the sum is 54.
The spelling of 5159621960082 in words is "five trillion, one hundred fifty-nine billion, six hundred twenty-one million, nine hundred sixty thousand, eighty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •