Base | Representation |
---|---|
bin | 11100110001111100… |
… | …11001000000000011 |
3 | 1110212211112010220202 |
4 | 32120332121000003 |
5 | 223121024102201 |
6 | 11033120555415 |
7 | 1054620453032 |
oct | 163076310003 |
9 | 43784463822 |
10 | 15451394051 |
11 | 6609a00055 |
12 | 2bb2782b6b |
13 | 15c3213422 |
14 | a68166719 |
15 | 60677ac6b |
hex | 398f99003 |
15451394051 has 2 divisors, whose sum is σ = 15451394052. Its totient is φ = 15451394050.
The previous prime is 15451394047. The next prime is 15451394053. The reversal of 15451394051 is 15049315451.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 15451394051 - 22 = 15451394047 is a prime.
Together with 15451394053, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 15451393996 and 15451394014.
It is not a weakly prime, because it can be changed into another prime (15451394053) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7725697025 + 7725697026.
It is an arithmetic number, because the mean of its divisors is an integer number (7725697026).
Almost surely, 215451394051 is an apocalyptic number.
15451394051 is a deficient number, since it is larger than the sum of its proper divisors (1).
15451394051 is an equidigital number, since it uses as much as digits as its factorization.
15451394051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 54000, while the sum is 38.
The spelling of 15451394051 in words is "fifteen billion, four hundred fifty-one million, three hundred ninety-four thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •