Base | Representation |
---|---|
bin | 1010101000000010… |
… | …11100001100100011 |
3 | 112201120021021200102 |
4 | 11110001130030203 |
5 | 43140341143300 |
6 | 2342022013015 |
7 | 261236364323 |
oct | 52401341443 |
9 | 15646237612 |
10 | 5704631075 |
11 | 246812a840 |
12 | 113257716b |
13 | 6cbb2cb60 |
14 | 3c18c3283 |
15 | 235c410d5 |
hex | 15405c323 |
5704631075 has 24 divisors (see below), whose sum is σ = 8310416016. Its totient is φ = 3829680000.
The previous prime is 5704631071. The next prime is 5704631087. The reversal of 5704631075 is 5701364075.
5704631075 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 5704631075 - 22 = 5704631071 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5704631071) 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 23 ways as a sum of consecutive naturals, for example, 794276 + ... + 801425.
It is an arithmetic number, because the mean of its divisors is an integer number (346267334).
Almost surely, 25704631075 is an apocalyptic number.
5704631075 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
5704631075 is a deficient number, since it is larger than the sum of its proper divisors (2605784941).
5704631075 is a wasteful number, since it uses less digits than its factorization.
5704631075 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1595735 (or 1595730 counting only the distinct ones).
The product of its (nonzero) digits is 88200, while the sum is 38.
The square root of 5704631075 is about 75529.0081690472. The cubic root of 5704631075 is about 1786.7996323819.
The spelling of 5704631075 in words is "five billion, seven hundred four million, six hundred thirty-one thousand, seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •