Base | Representation |
---|---|
bin | 100100011000010101011… |
… | …0111011010001111001000 |
3 | 122201000000212002101020012 |
4 | 1020300222313122033020 |
5 | 1123410111120213000 |
6 | 14344555114051052 |
7 | 1024146114053150 |
oct | 110605267321710 |
9 | 18630025071205 |
10 | 5000061101000 |
11 | 165857215a659 |
12 | 689066419a88 |
13 | 2a36719383c4 |
14 | 13400b92d760 |
15 | 8a0e2c90735 |
hex | 48c2adda3c8 |
5000061101000 has 128 divisors (see below), whose sum is σ = 13496562144000. Its totient is φ = 1698284851200.
The previous prime is 5000061100967. The next prime is 5000061101017. The reversal of 5000061101000 is 1011600005.
It is a super-3 number, since 3×50000611010003 (a number of 39 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Harshad number since it is a multiple of its sum of digits (14).
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, 2588825 + ... + 4086824.
It is an arithmetic number, because the mean of its divisors is an integer number (105441891750).
Almost surely, 25000061101000 is an apocalyptic number.
5000061101000 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
5000061101000 is an abundant number, since it is smaller than the sum of its proper divisors (8496501043000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5000061101000 is a wasteful number, since it uses less digits than its factorization.
5000061101000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6675784 (or 6675770 counting only the distinct ones).
The product of its (nonzero) digits is 30, while the sum is 14.
Adding to 5000061101000 its reverse (1011600005), we get a palindrome (5001072701005).
The spelling of 5000061101000 in words is "five trillion, sixty-one million, one hundred one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •