Base | Representation |
---|---|
bin | 1001111000011101… |
… | …11000101111111000 |
3 | 111200202020110111110 |
4 | 10330032320233320 |
5 | 41331202041322 |
6 | 2234243200320 |
7 | 245322012636 |
oct | 47416705770 |
9 | 14622213443 |
10 | 5305502712 |
11 | 22828aa794 |
12 | 10409760a0 |
13 | 667235223 |
14 | 3848a8356 |
15 | 210ba0c0c |
hex | 13c3b8bf8 |
5305502712 has 32 divisors (see below), whose sum is σ = 13572218880. Its totient is φ = 1727372640.
The previous prime is 5305502693. The next prime is 5305502717. The reversal of 5305502712 is 2172055035.
It is a self number, because there is not a number n which added to its sum of digits gives 5305502712.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5305502717) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2569464 + ... + 2571527.
It is an arithmetic number, because the mean of its divisors is an integer number (424131840).
Almost surely, 25305502712 is an apocalyptic number.
It is an amenable number.
5305502712 is an abundant number, since it is smaller than the sum of its proper divisors (8266716168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5305502712 is a wasteful number, since it uses less digits than its factorization.
5305502712 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5141043 (or 5141039 counting only the distinct ones).
The product of its (nonzero) digits is 10500, while the sum is 30.
The square root of 5305502712 is about 72838.8818695070. The cubic root of 5305502712 is about 1744.1165920636.
Adding to 5305502712 its reverse (2172055035), we get a palindrome (7477557747).
The spelling of 5305502712 in words is "five billion, three hundred five million, five hundred two thousand, seven hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •