Base | Representation |
---|---|
bin | 11100001110001001… |
… | …11110100111111101 |
3 | 1110002220112012121221 |
4 | 32013010332213331 |
5 | 222012142144013 |
6 | 10543233153341 |
7 | 1044313326655 |
oct | 160704764775 |
9 | 43086465557 |
10 | 15151131133 |
11 | 6475467086 |
12 | 2b2a0bb851 |
13 | 1575c52a68 |
14 | a3a325365 |
15 | 5da21908d |
hex | 38713e9fd |
15151131133 has 2 divisors, whose sum is σ = 15151131134. Its totient is φ = 15151131132.
The previous prime is 15151131109. The next prime is 15151131137. The reversal of 15151131133 is 33113115151.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 14992043364 + 159087769 = 122442^2 + 12613^2 .
It is a cyclic number.
It is not a de Polignac number, because 15151131133 - 25 = 15151131101 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 15151131098 and 15151131107.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (15151131137) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7575565566 + 7575565567.
It is an arithmetic number, because the mean of its divisors is an integer number (7575565567).
Almost surely, 215151131133 is an apocalyptic number.
It is an amenable number.
15151131133 is a deficient number, since it is larger than the sum of its proper divisors (1).
15151131133 is an equidigital number, since it uses as much as digits as its factorization.
15151131133 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 675, while the sum is 25.
Adding to 15151131133 its reverse (33113115151), we get a palindrome (48264246284).
The spelling of 15151131133 in words is "fifteen billion, one hundred fifty-one million, one hundred thirty-one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •