Base | Representation |
---|---|
bin | 1010100111111000… |
… | …10111000110111010 |
3 | 112201110202122010100 |
4 | 11103330113012322 |
5 | 43140021041024 |
6 | 2341533300230 |
7 | 261222150243 |
oct | 52374270672 |
9 | 15643678110 |
10 | 5703299514 |
11 | 2467400380 |
12 | 1132034676 |
13 | 6cb784a53 |
14 | 3c1657cca |
15 | 235a7b7c9 |
hex | 153f171ba |
5703299514 has 48 divisors (see below), whose sum is σ = 13499871840. Its totient is φ = 1725792480.
The previous prime is 5703299509. The next prime is 5703299527. The reversal of 5703299514 is 4159923075.
It is a happy number.
5703299514 is a `hidden beast` number, since 570 + 3 + 29 + 9 + 51 + 4 = 666.
It is a Smith number, since the sum of its digits (45) coincides with the sum of the digits of its prime factors.
It is a self number, because there is not a number n which added to its sum of digits gives 5703299514.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 120069 + ... + 160695.
It is an arithmetic number, because the mean of its divisors is an integer number (281247330).
Almost surely, 25703299514 is an apocalyptic number.
5703299514 is an abundant number, since it is smaller than the sum of its proper divisors (7796572326).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5703299514 is a wasteful number, since it uses less digits than its factorization.
5703299514 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41355 (or 41352 counting only the distinct ones).
The product of its (nonzero) digits is 340200, while the sum is 45.
The square root of 5703299514 is about 75520.1927566396. The cubic root of 5703299514 is about 1786.6605981004.
The spelling of 5703299514 in words is "five billion, seven hundred three million, two hundred ninety-nine thousand, five hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •