Base | Representation |
---|---|
bin | 101001111011001000… |
… | …000101110100110101 |
3 | 11022012012101211021202 |
4 | 221323020011310311 |
5 | 1214142420012131 |
6 | 32402500022245 |
7 | 3152344341401 |
oct | 517310056465 |
9 | 138165354252 |
10 | 45015391541 |
11 | 18100018a2a |
12 | 8883691985 |
13 | 432516ca73 |
14 | 2270718101 |
15 | 1286e7dbcb |
hex | a7b205d35 |
45015391541 has 2 divisors, whose sum is σ = 45015391542. Its totient is φ = 45015391540.
The previous prime is 45015391513. The next prime is 45015391567. The reversal of 45015391541 is 14519351054.
45015391541 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 36538322500 + 8477069041 = 191150^2 + 92071^2 .
It is a cyclic number.
It is not a de Polignac number, because 45015391541 - 210 = 45015390517 is a prime.
It is a super-3 number, since 3×450153915413 (a number of 33 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 45015391495 and 45015391504.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (45015391501) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 22507695770 + 22507695771.
It is an arithmetic number, because the mean of its divisors is an integer number (22507695771).
Almost surely, 245015391541 is an apocalyptic number.
It is an amenable number.
45015391541 is a deficient number, since it is larger than the sum of its proper divisors (1).
45015391541 is an equidigital number, since it uses as much as digits as its factorization.
45015391541 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 54000, while the sum is 38.
The spelling of 45015391541 in words is "forty-five billion, fifteen million, three hundred ninety-one thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •