Base | Representation |
---|---|
bin | 11011110000110010100000… |
… | …01110001110000001000010 |
3 | 22000011022202020102111220020 |
4 | 31320121100032032001002 |
5 | 31000220410312100200 |
6 | 333501553215154310 |
7 | 15600501120542211 |
oct | 1570312016160102 |
9 | 260138666374806 |
10 | 61050011050050 |
11 | 184a8189738120 |
12 | 6a1ba99215996 |
13 | 280acb6c85529 |
14 | 1110b9cb49078 |
15 | 70d0b6b42ea0 |
hex | 37865038e042 |
61050011050050 has 96 divisors (see below), whose sum is σ = 169632030873024. Its totient is φ = 14400002592000.
The previous prime is 61050011049953. The next prime is 61050011050057. The reversal of 61050011050050 is 5005011005016.
It is a super-2 number, since 2×610500110500502 (a number of 28 digits) contains 22 as substring.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 61050011050050.
It is not an unprimeable number, because it can be changed into a prime (61050011050057) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 499939041 + ... + 500061140.
It is an arithmetic number, because the mean of its divisors is an integer number (1767000321594).
Almost surely, 261050011050050 is an apocalyptic number.
61050011050050 is an abundant number, since it is smaller than the sum of its proper divisors (108582019822974).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
61050011050050 is a wasteful number, since it uses less digits than its factorization.
61050011050050 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1000000244 (or 1000000239 counting only the distinct ones).
The product of its (nonzero) digits is 750, while the sum is 24.
Adding to 61050011050050 its reverse (5005011005016), we get a palindrome (66055022055066).
The spelling of 61050011050050 in words is "sixty-one trillion, fifty billion, eleven million, fifty thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.203 sec. • engine limits •