Base | Representation |
---|---|
bin | 10101000010100101011… |
… | …000011100101000111001 |
3 | 12010020002010012021100102 |
4 | 111002211120130220321 |
5 | 142142132204121412 |
6 | 3024121344445145 |
7 | 206314226223026 |
oct | 25024530345071 |
9 | 5106063167312 |
10 | 1445883660857 |
11 | 5082176a5869 |
12 | 1b427b6197b5 |
13 | a646691065c |
14 | 4dda438054d |
15 | 2792644d8c2 |
hex | 150a561ca39 |
1445883660857 has 4 divisors (see below), whose sum is σ = 1445893808676. Its totient is φ = 1445873513040.
The previous prime is 1445883660853. The next prime is 1445883660869. The reversal of 1445883660857 is 7580663885441.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1213987479721 + 231896181136 = 1101811^2 + 481556^2 .
It is a cyclic number.
It is not a de Polignac number, because 1445883660857 - 22 = 1445883660853 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1445883660793 and 1445883660802.
It is not an unprimeable number, because it can be changed into a prime (1445883660853) 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, 4857098 + ... + 5146179.
It is an arithmetic number, because the mean of its divisors is an integer number (361473452169).
Almost surely, 21445883660857 is an apocalyptic number.
It is an amenable number.
1445883660857 is a deficient number, since it is larger than the sum of its proper divisors (10147819).
1445883660857 is a wasteful number, since it uses less digits than its factorization.
1445883660857 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10147818.
The product of its (nonzero) digits is 154828800, while the sum is 65.
The spelling of 1445883660857 in words is "one trillion, four hundred forty-five billion, eight hundred eighty-three million, six hundred sixty thousand, eight hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •