Base | Representation |
---|---|
bin | 10010110000100011… |
… | …00001110110111101 |
3 | 221222212012222120100 |
4 | 21120101201312331 |
5 | 131111124042413 |
6 | 4343154511313 |
7 | 504365306412 |
oct | 113021416675 |
9 | 27885188510 |
10 | 10070924733 |
11 | 42a88578a1 |
12 | 1b50895539 |
13 | c465c0b7c |
14 | 6b7746109 |
15 | 3de21ca73 |
hex | 258461dbd |
10070924733 has 12 divisors (see below), whose sum is σ = 14599410748. Its totient is φ = 6689710080.
The previous prime is 10070924723. The next prime is 10070924753. The reversal of 10070924733 is 33742907001.
10070924733 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 6848886564 + 3222038169 = 82758^2 + 56763^2 .
It is not a de Polignac number, because 10070924733 - 28 = 10070924477 is a prime.
It is a super-2 number, since 2×100709247332 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10070924723) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 2017348 + ... + 2022333.
Almost surely, 210070924733 is an apocalyptic number.
It is an amenable number.
10070924733 is a deficient number, since it is larger than the sum of its proper divisors (4528486015).
10070924733 is a wasteful number, since it uses less digits than its factorization.
10070924733 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4039964 (or 4039961 counting only the distinct ones).
The product of its (nonzero) digits is 31752, while the sum is 36.
The spelling of 10070924733 in words is "ten billion, seventy million, nine hundred twenty-four thousand, seven hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •