Base | Representation |
---|---|
bin | 1001010111001010… |
… | …11010101010101100 |
3 | 110222021200012220121 |
4 | 10223211122222230 |
5 | 40243201234030 |
6 | 2150424454324 |
7 | 235360651030 |
oct | 45345325254 |
9 | 13867605817 |
10 | 5026196140 |
11 | 214a17a609 |
12 | b8331a3a4 |
13 | 621401374 |
14 | 3597601c0 |
15 | 1e63cd47a |
hex | 12b95aaac |
5026196140 has 96 divisors (see below), whose sum is σ = 12294374400. Its totient is φ = 1690496256.
The previous prime is 5026196113. The next prime is 5026196159. The reversal of 5026196140 is 416916205.
It is a junction number, because it is equal to n+sod(n) for n = 5026196096 and 5026196105.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1729929 + ... + 1732831.
It is an arithmetic number, because the mean of its divisors is an integer number (128066400).
Almost surely, 25026196140 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 5026196140, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6147187200).
5026196140 is an abundant number, since it is smaller than the sum of its proper divisors (7268178260).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5026196140 is a wasteful number, since it uses less digits than its factorization.
5026196140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3151 (or 3149 counting only the distinct ones).
The product of its (nonzero) digits is 12960, while the sum is 34.
The square root of 5026196140 is about 70895.6708128219. The cubic root of 5026196140 is about 1712.9570644236.
The spelling of 5026196140 in words is "five billion, twenty-six million, one hundred ninety-six thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •