Base | Representation |
---|---|
bin | 10011010110111100000… |
… | …10011011001011100001 |
3 | 2100120212110100010202002 |
4 | 21223132002123023201 |
5 | 41344211414004103 |
6 | 1225322111533345 |
7 | 66025016625341 |
oct | 11533602331341 |
9 | 2316773303662 |
10 | 665150141153 |
11 | 2370a7a06963 |
12 | a8ab152a255 |
13 | 4a9533944a4 |
14 | 2429cb1cd21 |
15 | 1247e7d3488 |
hex | 9ade09b2e1 |
665150141153 has 4 divisors (see below), whose sum is σ = 665153826708. Its totient is φ = 665146455600.
The previous prime is 665150141141. The next prime is 665150141197. The reversal of 665150141153 is 351141051566.
It is a happy number.
665150141153 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 144087049744 + 521063091409 = 379588^2 + 721847^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-665150141153 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (665150141753) 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, 1557326 + ... + 1937927.
It is an arithmetic number, because the mean of its divisors is an integer number (166288456677).
Almost surely, 2665150141153 is an apocalyptic number.
It is an amenable number.
665150141153 is a deficient number, since it is larger than the sum of its proper divisors (3685555).
665150141153 is a wasteful number, since it uses less digits than its factorization.
665150141153 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3685554.
The product of its (nonzero) digits is 54000, while the sum is 38.
The spelling of 665150141153 in words is "six hundred sixty-five billion, one hundred fifty million, one hundred forty-one thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •