Base | Representation |
---|---|
bin | 11100001011110000… |
… | …01111000000011111 |
3 | 1110001111200002221111 |
4 | 32011320033000133 |
5 | 221442014410101 |
6 | 10541234042451 |
7 | 1043650326652 |
oct | 160570170037 |
9 | 43044602844 |
10 | 15131013151 |
11 | 6465076151 |
12 | 2b23419427 |
13 | 1571a2aa27 |
14 | a377a9899 |
15 | 5d8593251 |
hex | 385e0f01f |
15131013151 has 4 divisors (see below), whose sum is σ = 15788883312. Its totient is φ = 14473142992.
The previous prime is 15131013133. The next prime is 15131013179.
15131013151 is nontrivially palindromic in base 10.
15131013151 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.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-15131013151 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 (15131013181) 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, 328935046 + ... + 328935091.
It is an arithmetic number, because the mean of its divisors is an integer number (3947220828).
Almost surely, 215131013151 is an apocalyptic number.
15131013151 is a deficient number, since it is larger than the sum of its proper divisors (657870161).
15131013151 is an equidigital number, since it uses as much as digits as its factorization.
15131013151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 657870160.
The product of its (nonzero) digits is 225, while the sum is 22.
It can be divided in two parts, 151310 and 13151, that added together give a palindrome (164461).
The spelling of 15131013151 in words is "fifteen billion, one hundred thirty-one million, thirteen thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •