Base | Representation |
---|---|
bin | 101100011000101010100… |
… | …110011111010100101000 |
3 | 101210120221121101001102012 |
4 | 230120222212133110220 |
5 | 344433142211404000 |
6 | 10253114330055052 |
7 | 433236231041141 |
oct | 54305246372450 |
9 | 11716847331365 |
10 | 3050141513000 |
11 | a7661540461a |
12 | 41317a27a488 |
13 | 19181c9b981a |
14 | a78b0342ac8 |
15 | 5451b73d735 |
hex | 2c62a99f528 |
3050141513000 has 128 divisors (see below), whose sum is σ = 7614868060800. Its totient is φ = 1139522176000.
The previous prime is 3050141512997. The next prime is 3050141513009. The reversal of 3050141513000 is 3151410503.
It is not an unprimeable number, because it can be changed into a prime (3050141513009) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1542191 + ... + 2911809.
It is an arithmetic number, because the mean of its divisors is an integer number (59491156725).
Almost surely, 23050141513000 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 3050141513000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3807434030400).
3050141513000 is an abundant number, since it is smaller than the sum of its proper divisors (4564726547800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3050141513000 is a wasteful number, since it uses less digits than its factorization.
3050141513000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1369788 (or 1369774 counting only the distinct ones).
The product of its (nonzero) digits is 900, while the sum is 23.
Adding to 3050141513000 its reverse (3151410503), we get a palindrome (3053292923503).
The spelling of 3050141513000 in words is "three trillion, fifty billion, one hundred forty-one million, five hundred thirteen thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •