Base | Representation |
---|---|
bin | 1011111011000111110010… |
… | …0101101100110011111010 |
3 | 1201102100001110200212001010 |
4 | 2332301330211230303322 |
5 | 3204244424043220200 |
6 | 43514445212534350 |
7 | 2522122132042446 |
oct | 276617445546372 |
9 | 51370043625033 |
10 | 13110330445050 |
11 | 41a5072829093 |
12 | 1578a531813b6 |
13 | 7413b6782827 |
14 | 334787065826 |
15 | 17b06a7a4150 |
hex | bec7c96ccfa |
13110330445050 has 96 divisors (see below), whose sum is σ = 32570602972992. Its totient is φ = 3489966305280.
The previous prime is 13110330445039. The next prime is 13110330445099. The reversal of 13110330445050 is 5054403301131.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 13110330444999 and 13110330445017.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 199494297 + ... + 199560003.
It is an arithmetic number, because the mean of its divisors is an integer number (339277114302).
Almost surely, 213110330445050 is an apocalyptic number.
13110330445050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13110330445050 is an abundant number, since it is smaller than the sum of its proper divisors (19460272527942).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13110330445050 is a wasteful number, since it uses less digits than its factorization.
13110330445050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 68032 (or 68027 counting only the distinct ones).
The product of its (nonzero) digits is 10800, while the sum is 30.
Adding to 13110330445050 its reverse (5054403301131), we get a palindrome (18164733746181).
The spelling of 13110330445050 in words is "thirteen trillion, one hundred ten billion, three hundred thirty million, four hundred forty-five thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •