Base | Representation |
---|---|
bin | 10010111000011110… |
… | …00101010100110011 |
3 | 222011111021220010002 |
4 | 21130033011110303 |
5 | 131230133024220 |
6 | 4353531300215 |
7 | 506133261662 |
oct | 113417052463 |
9 | 28144256102 |
10 | 10137392435 |
11 | 4332325a85 |
12 | 1b6abaa66b |
13 | c572c3981 |
14 | 6c24c8dd9 |
15 | 3e4e9bc75 |
hex | 25c3c5533 |
10137392435 has 4 divisors (see below), whose sum is σ = 12164870928. Its totient is φ = 8109913944.
The previous prime is 10137392431. The next prime is 10137392443. The reversal of 10137392435 is 53429373101.
10137392435 is digitally balanced in base 2 and base 3, because in such bases it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 53429373101 = 13 ⋅4109951777.
It is a cyclic number.
It is not a de Polignac number, because 10137392435 - 22 = 10137392431 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10137392431) 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 3 ways as a sum of consecutive naturals, for example, 1013739239 + ... + 1013739248.
It is an arithmetic number, because the mean of its divisors is an integer number (3041217732).
Almost surely, 210137392435 is an apocalyptic number.
10137392435 is a deficient number, since it is larger than the sum of its proper divisors (2027478493).
10137392435 is an equidigital number, since it uses as much as digits as its factorization.
10137392435 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2027478492.
The product of its (nonzero) digits is 68040, while the sum is 38.
The spelling of 10137392435 in words is "ten billion, one hundred thirty-seven million, three hundred ninety-two thousand, four hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •