Base | Representation |
---|---|
bin | 1011000101010110… |
… | …10101101011011011 |
3 | 120100200220111012102 |
4 | 11202223111223123 |
5 | 44141311323301 |
6 | 2422243434015 |
7 | 300313243145 |
oct | 54253255333 |
9 | 16320814172 |
10 | 5950495451 |
11 | 258399933a |
12 | 11a098590b |
13 | 73aa55034 |
14 | 406403c95 |
15 | 24c609b6b |
hex | 162ad5adb |
5950495451 has 2 divisors, whose sum is σ = 5950495452. Its totient is φ = 5950495450.
The previous prime is 5950495423. The next prime is 5950495457. The reversal of 5950495451 is 1545940595.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 5950495451 - 218 = 5950233307 is a prime.
It is a super-2 number, since 2×59504954512 = 70816792224743386802, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5950495396 and 5950495405.
It is not a weakly prime, because it can be changed into another prime (5950495457) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2975247725 + 2975247726.
It is an arithmetic number, because the mean of its divisors is an integer number (2975247726).
Almost surely, 25950495451 is an apocalyptic number.
5950495451 is a deficient number, since it is larger than the sum of its proper divisors (1).
5950495451 is an equidigital number, since it uses as much as digits as its factorization.
5950495451 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 810000, while the sum is 47.
The square root of 5950495451 is about 77139.4545676854. The cubic root of 5950495451 is about 1812.1092441247.
The spelling of 5950495451 in words is "five billion, nine hundred fifty million, four hundred ninety-five thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •