Base | Representation |
---|---|
bin | 11100001000110001… |
… | …11000000011111001 |
3 | 1102222202122002120212 |
4 | 32010120320003321 |
5 | 221414114443411 |
6 | 10534542200505 |
7 | 1043225004314 |
oct | 160430700371 |
9 | 42882562525 |
10 | 15106015481 |
11 | 6451a52017 |
12 | 2b16b83135 |
13 | 15697b78cb |
14 | a3433d97b |
15 | 5d62a668b |
hex | 3846380f9 |
15106015481 has 2 divisors, whose sum is σ = 15106015482. Its totient is φ = 15106015480.
The previous prime is 15106015447. The next prime is 15106015501. The reversal of 15106015481 is 18451060151.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 14135069881 + 970945600 = 118891^2 + 31160^2 .
It is a cyclic number.
It is not a de Polignac number, because 15106015481 - 222 = 15101821177 is a prime.
It is a super-2 number, since 2×151060154812 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (15106015411) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7553007740 + 7553007741.
It is an arithmetic number, because the mean of its divisors is an integer number (7553007741).
Almost surely, 215106015481 is an apocalyptic number.
It is an amenable number.
15106015481 is a deficient number, since it is larger than the sum of its proper divisors (1).
15106015481 is an equidigital number, since it uses as much as digits as its factorization.
15106015481 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4800, while the sum is 32.
The spelling of 15106015481 in words is "fifteen billion, one hundred six million, fifteen thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •