Base | Representation |
---|---|
bin | 1110000011011111001001… |
… | …1100111101001010101001 |
3 | 2000201022001200011010001201 |
4 | 3200313302130331022221 |
5 | 4011140334122244203 |
6 | 52511012353444201 |
7 | 3153306233405500 |
oct | 340676234751251 |
9 | 60638050133051 |
10 | 15453065040553 |
11 | 4a1867639a298 |
12 | 1896aa8270661 |
13 | 8812aa6053aa |
14 | 3b5d0a4a1837 |
15 | 1bbe82a42e1d |
hex | e0df273d2a9 |
15453065040553 has 6 divisors (see below), whose sum is σ = 17976014434986. Its totient is φ = 13245484320432.
The previous prime is 15453065040527. The next prime is 15453065040583. The reversal of 15453065040553 is 35504056035451.
It can be written as a sum of positive squares in only one way, i.e., 12345047656704 + 3108017383849 = 3513552^2 + 1762957^2 .
It is not a de Polignac number, because 15453065040553 - 225 = 15453031486121 is a prime.
It is a super-2 number, since 2×154530650405532 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (15453065040583) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 157684337100 + ... + 157684337197.
It is an arithmetic number, because the mean of its divisors is an integer number (2996002405831).
Almost surely, 215453065040553 is an apocalyptic number.
It is an amenable number.
15453065040553 is a deficient number, since it is larger than the sum of its proper divisors (2522949394433).
15453065040553 is an equidigital number, since it uses as much as digits as its factorization.
15453065040553 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 315368674311 (or 315368674304 counting only the distinct ones).
The product of its (nonzero) digits is 2700000, while the sum is 46.
The spelling of 15453065040553 in words is "fifteen trillion, four hundred fifty-three billion, sixty-five million, forty thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •