Base | Representation |
---|---|
bin | 11100000001100011… |
… | …01011110101010011 |
3 | 1102211112121000200021 |
4 | 32000301223311103 |
5 | 221303111111011 |
6 | 10524535204311 |
7 | 1041560606323 |
oct | 160061536523 |
9 | 42745530607 |
10 | 15045410131 |
11 | 6420818354 |
12 | 2aba816697 |
13 | 155a08825b |
14 | a2a285283 |
15 | 5d0cd4471 |
hex | 380c6bd53 |
15045410131 has 2 divisors, whose sum is σ = 15045410132. Its totient is φ = 15045410130.
The previous prime is 15045410101. The next prime is 15045410189. The reversal of 15045410131 is 13101454051.
15045410131 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 15045410131 - 29 = 15045409619 is a prime.
It is a super-2 number, since 2×150454101312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 15045410096 and 15045410105.
It is not a weakly prime, because it can be changed into another prime (15045410101) 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 as a sum of consecutive naturals, namely, 7522705065 + 7522705066.
It is an arithmetic number, because the mean of its divisors is an integer number (7522705066).
Almost surely, 215045410131 is an apocalyptic number.
15045410131 is a deficient number, since it is larger than the sum of its proper divisors (1).
15045410131 is an equidigital number, since it uses as much as digits as its factorization.
15045410131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1200, while the sum is 25.
Adding to 15045410131 its reverse (13101454051), we get a palindrome (28146864182).
The spelling of 15045410131 in words is "fifteen billion, forty-five million, four hundred ten thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •