Base | Representation |
---|---|
bin | 100100110100110000110… |
… | …1100110010100011010010 |
3 | 122220211121111111120020020 |
4 | 1021221201230302203102 |
5 | 1130410123303343114 |
6 | 14433013032524310 |
7 | 1031440016225250 |
oct | 111514154624322 |
9 | 18824544446206 |
10 | 5061110606034 |
11 | 168144aaa334a |
12 | 698a63850696 |
13 | 2a9350946792 |
14 | 136d5d9395d0 |
15 | 8b9b7702aa9 |
hex | 49a61b328d2 |
5061110606034 has 64 divisors (see below), whose sum is σ = 11595426585600. Its totient is φ = 1442637915840.
The previous prime is 5061110605949. The next prime is 5061110606039. The reversal of 5061110606034 is 4306060111605.
It is a super-2 number, since 2×50611106060342 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5061110605986 and 5061110606004.
It is not an unprimeable number, because it can be changed into a prime (5061110606039) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 40683312 + ... + 40807524.
It is an arithmetic number, because the mean of its divisors is an integer number (181178540400).
Almost surely, 25061110606034 is an apocalyptic number.
5061110606034 is an abundant number, since it is smaller than the sum of its proper divisors (6534315979566).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5061110606034 is a wasteful number, since it uses less digits than its factorization.
5061110606034 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 126495.
The product of its (nonzero) digits is 12960, while the sum is 33.
Adding to 5061110606034 its reverse (4306060111605), we get a palindrome (9367170717639).
The spelling of 5061110606034 in words is "five trillion, sixty-one billion, one hundred ten million, six hundred six thousand, thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •