Base | Representation |
---|---|
bin | 1011000101000101… |
… | …11001110000001000 |
3 | 120100112202010112120 |
4 | 11202202321300020 |
5 | 44140230041122 |
6 | 2422124211240 |
7 | 300255402414 |
oct | 54242716010 |
9 | 16315663476 |
10 | 5948283912 |
11 | 258271881a |
12 | 11a0099b20 |
13 | 73a45c52c |
14 | 405dc9d44 |
15 | 24c31e75c |
hex | 1628b9c08 |
5948283912 has 64 divisors (see below), whose sum is σ = 15304956480. Its totient is φ = 1925398272.
The previous prime is 5948283899. The next prime is 5948283917. The reversal of 5948283912 is 2193828495.
It is not an unprimeable number, because it can be changed into a prime (5948283917) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 161878 + ... + 195194.
It is an arithmetic number, because the mean of its divisors is an integer number (239139945).
Almost surely, 25948283912 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 5948283912, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7652478240).
5948283912 is an abundant number, since it is smaller than the sum of its proper divisors (9356672568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5948283912 is a wasteful number, since it uses less digits than its factorization.
5948283912 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33542 (or 33538 counting only the distinct ones).
The product of its digits is 1244160, while the sum is 51.
The square root of 5948283912 is about 77125.1185542039. The cubic root of 5948283912 is about 1811.8847223809.
The spelling of 5948283912 in words is "five billion, nine hundred forty-eight million, two hundred eighty-three thousand, nine hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •