Base | Representation |
---|---|
bin | 10011011011111110… |
… | …10011010001100101 |
3 | 222221020202101020101 |
4 | 21231333103101211 |
5 | 132332410321112 |
6 | 4443251304101 |
7 | 516411056161 |
oct | 115577232145 |
9 | 28836671211 |
10 | 10435245157 |
11 | 4475473157 |
12 | 20328ab031 |
13 | ca3c1c29c |
14 | 70dc9dca1 |
15 | 4111d4757 |
hex | 26dfd3465 |
10435245157 has 4 divisors (see below), whose sum is σ = 10443342060. Its totient is φ = 10427148256.
The previous prime is 10435245143. The next prime is 10435245179. The reversal of 10435245157 is 75154253401.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 75154253401 = 61 ⋅1232036941.
It can be written as a sum of positive squares in 2 ways, for example, as 9286984161 + 1148260996 = 96369^2 + 33886^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10435245157 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10435245187) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4046518 + ... + 4049095.
It is an arithmetic number, because the mean of its divisors is an integer number (2610835515).
Almost surely, 210435245157 is an apocalyptic number.
It is an amenable number.
10435245157 is a deficient number, since it is larger than the sum of its proper divisors (8096903).
10435245157 is an equidigital number, since it uses as much as digits as its factorization.
10435245157 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8096902.
The product of its (nonzero) digits is 84000, while the sum is 37.
Adding to 10435245157 its reverse (75154253401), we get a palindrome (85589498558).
The spelling of 10435245157 in words is "ten billion, four hundred thirty-five million, two hundred forty-five thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •