Base | Representation |
---|---|
bin | 11100001011101111… |
… | …10110100101111111 |
3 | 1110001111111000202210 |
4 | 32011313312211333 |
5 | 221442003210101 |
6 | 10541231551503 |
7 | 1043646432264 |
oct | 160567664577 |
9 | 43044430683 |
10 | 15130913151 |
11 | 6465008002 |
12 | 2b2338b593 |
13 | 15719c4363 |
14 | a3778126b |
15 | 5d85737d6 |
hex | 385df697f |
15130913151 has 16 divisors (see below), whose sum is σ = 20325089664. Its totient is φ = 10012146144.
The previous prime is 15130913123. The next prime is 15130913167. The reversal of 15130913151 is 15131903151.
It is not a de Polignac number, because 15130913151 - 27 = 15130913023 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (15130913191) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 429076 + ... + 462998.
It is an arithmetic number, because the mean of its divisors is an integer number (1270318104).
Almost surely, 215130913151 is an apocalyptic number.
15130913151 is a deficient number, since it is larger than the sum of its proper divisors (5194176513).
15130913151 is a wasteful number, since it uses less digits than its factorization.
15130913151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35030.
The product of its (nonzero) digits is 2025, while the sum is 30.
The spelling of 15130913151 in words is "fifteen billion, one hundred thirty million, nine hundred thirteen thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •