Base | Representation |
---|---|
bin | 11111001110000101010… |
… | …100100110011000110111 |
3 | 21121002201101111011201021 |
4 | 133032011110212120313 |
5 | 240122312403404201 |
6 | 4321332253042011 |
7 | 311000433303325 |
oct | 37160524463067 |
9 | 7532641434637 |
10 | 2145425450551 |
11 | 757962810259 |
12 | 2a796a786307 |
13 | 12740b167826 |
14 | 75ba688ad15 |
15 | 3ac1a194ea1 |
hex | 1f385526637 |
2145425450551 has 4 divisors (see below), whose sum is σ = 2147855151832. Its totient is φ = 2142995749272.
The previous prime is 2145425450549. The next prime is 2145425450561. The reversal of 2145425450551 is 1550545245412.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 2145425450551 - 21 = 2145425450549 is a prime.
It is a super-2 number, since 2×21454254505512 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2145425450498 and 2145425450507.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2145425450561) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1214849316 + ... + 1214851081.
It is an arithmetic number, because the mean of its divisors is an integer number (536963787958).
Almost surely, 22145425450551 is an apocalyptic number.
2145425450551 is a deficient number, since it is larger than the sum of its proper divisors (2429701281).
2145425450551 is an equidigital number, since it uses as much as digits as its factorization.
2145425450551 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2429701280.
The product of its (nonzero) digits is 800000, while the sum is 43.
The spelling of 2145425450551 in words is "two trillion, one hundred forty-five billion, four hundred twenty-five million, four hundred fifty thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •