Base | Representation |
---|---|
bin | 100100110111000110100… |
… | …0111101101100011100001 |
3 | 122221022120121000000022000 |
4 | 1021232031013231203201 |
5 | 1131000420304113131 |
6 | 14435203322434213 |
7 | 1032005344630440 |
oct | 111561507554341 |
9 | 18838517000260 |
10 | 5066134051041 |
11 | 1683598663998 |
12 | 699a26062969 |
13 | 2a99715c384b |
14 | 1372b8b80d57 |
15 | 8bbad73ace6 |
hex | 49b8d1ed8e1 |
5066134051041 has 16 divisors (see below), whose sum is σ = 8577581462400. Its totient is φ = 2894933743344.
The previous prime is 5066134051037. The next prime is 5066134051141. The reversal of 5066134051041 is 1401504316605.
5066134051041 is a `hidden beast` number, since 5 + 0 + 6 + 6 + 134 + 0 + 510 + 4 + 1 = 666.
It is not a de Polignac number, because 5066134051041 - 22 = 5066134051037 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 5066134050987 and 5066134051005.
It is not an unprimeable number, because it can be changed into a prime (5066134051141) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 13402470846 + ... + 13402471223.
It is an arithmetic number, because the mean of its divisors is an integer number (536098841400).
Almost surely, 25066134051041 is an apocalyptic number.
It is an amenable number.
5066134051041 is a deficient number, since it is larger than the sum of its proper divisors (3511447411359).
5066134051041 is a wasteful number, since it uses less digits than its factorization.
5066134051041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26804942085 (or 26804942079 counting only the distinct ones).
The product of its (nonzero) digits is 43200, while the sum is 36.
Adding to 5066134051041 its reverse (1401504316605), we get a palindrome (6467638367646).
The spelling of 5066134051041 in words is "five trillion, sixty-six billion, one hundred thirty-four million, fifty-one thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •