Base | Representation |
---|---|
bin | 1011000101001101… |
… | …10010010110101110 |
3 | 120100121122212100120 |
4 | 11202212302112232 |
5 | 44141010132230 |
6 | 2422202105410 |
7 | 300300143226 |
oct | 54246622656 |
9 | 16317585316 |
10 | 5949302190 |
11 | 2583253877 |
12 | 11a04ab266 |
13 | 73a727b70 |
14 | 4061b3086 |
15 | 24c471310 |
hex | 1629b25ae |
5949302190 has 64 divisors (see below), whose sum is σ = 15465715776. Its totient is φ = 1455962112.
The previous prime is 5949302147. The next prime is 5949302273. The reversal of 5949302190 is 912039495.
It is a super-2 number, since 2×59493021902 = 70788393095877592200, which contains 22 as substring.
It is a Curzon number.
It is a congruent number.
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, 23382 + ... + 111558.
It is an arithmetic number, because the mean of its divisors is an integer number (241651809).
Almost surely, 25949302190 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5949302190, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7732857888).
5949302190 is an abundant number, since it is smaller than the sum of its proper divisors (9516413586).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5949302190 is a wasteful number, since it uses less digits than its factorization.
5949302190 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 88373.
The product of its (nonzero) digits is 87480, while the sum is 42.
The square root of 5949302190 is about 77131.7197396765. The cubic root of 5949302190 is about 1811.9881077778.
The spelling of 5949302190 in words is "five billion, nine hundred forty-nine million, three hundred two thousand, one hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •