Base | Representation |
---|---|
bin | 11100000101010101… |
… | …10010101000101111 |
3 | 1102220202022221202220 |
4 | 32002222302220233 |
5 | 221334223014143 |
6 | 10532031450423 |
7 | 1042424503116 |
oct | 160252625057 |
9 | 42822287686 |
10 | 15077157423 |
11 | 6437731589 |
12 | 2b09386a13 |
13 | 1563822633 |
14 | a3058ac7d |
15 | 5d39a5d83 |
hex | 382ab2a2f |
15077157423 has 4 divisors (see below), whose sum is σ = 20102876568. Its totient is φ = 10051438280.
The previous prime is 15077157413. The next prime is 15077157437. The reversal of 15077157423 is 32475177051.
15077157423 is digitally balanced in base 2, because in such base 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: 32475177051 = 3 ⋅10825059017.
It is a cyclic number.
It is not a de Polignac number, because 15077157423 - 218 = 15076895279 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (15077157413) 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, 2512859568 + ... + 2512859573.
It is an arithmetic number, because the mean of its divisors is an integer number (5025719142).
Almost surely, 215077157423 is an apocalyptic number.
15077157423 is a deficient number, since it is larger than the sum of its proper divisors (5025719145).
15077157423 is an equidigital number, since it uses as much as digits as its factorization.
15077157423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5025719144.
The product of its (nonzero) digits is 205800, while the sum is 42.
The spelling of 15077157423 in words is "fifteen billion, seventy-seven million, one hundred fifty-seven thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •