Base | Representation |
---|---|
bin | 10000101010011111101… |
… | …010011111001000101101 |
3 | 11001110210202222011011122 |
4 | 100222133222133020231 |
5 | 122230221321000121 |
6 | 2234023044430325 |
7 | 145506431346515 |
oct | 20523752371055 |
9 | 4043722864148 |
10 | 1145140015661 |
11 | 401718759964 |
12 | 165b290a83a5 |
13 | 83ca8a00905 |
14 | 3d5d4582845 |
15 | 1ebc384a5ab |
hex | 10a9fa9f22d |
1145140015661 has 8 divisors (see below), whose sum is σ = 1189304240760. Its totient is φ = 1101671290368.
The previous prime is 1145140015637. The next prime is 1145140015667. The reversal of 1145140015661 is 1665100415411.
It can be written as a sum of positive squares in 4 ways, for example, as 564442674436 + 580697341225 = 751294^2 + 762035^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1145140015661 - 26 = 1145140015597 is a prime.
It is a super-2 number, since 2×11451400156612 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1145140015667) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 173871596 + ... + 173878181.
It is an arithmetic number, because the mean of its divisors is an integer number (148663030095).
Almost surely, 21145140015661 is an apocalyptic number.
It is an amenable number.
1145140015661 is a deficient number, since it is larger than the sum of its proper divisors (44164225099).
1145140015661 is an equidigital number, since it uses as much as digits as its factorization.
1145140015661 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 347749903.
The product of its (nonzero) digits is 14400, while the sum is 35.
The spelling of 1145140015661 in words is "one trillion, one hundred forty-five billion, one hundred forty million, fifteen thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •