Base | Representation |
---|---|
bin | 11111001110000000111… |
… | …110111011010101111111 |
3 | 21121002112022112001022221 |
4 | 133032000332323111333 |
5 | 240122140240112401 |
6 | 4321321132550211 |
7 | 310665560506105 |
oct | 37160076732577 |
9 | 7532468461287 |
10 | 2145352660351 |
11 | 75792571396a |
12 | 2a794a322367 |
13 | 1273c905ccc4 |
14 | 75b9ad3dc75 |
15 | 3ac13ab77a1 |
hex | 1f380fbb57f |
2145352660351 has 4 divisors (see below), whose sum is σ = 2153269091104. Its totient is φ = 2137436229600.
The previous prime is 2145352660313. The next prime is 2145352660361. The reversal of 2145352660351 is 1530662535412.
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 2145352660351 - 29 = 2145352659839 is a prime.
It is a super-2 number, since 2×21453526603512 (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 = 2145352660298 and 2145352660307.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2145352660361) 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, 3958214970 + ... + 3958215511.
It is an arithmetic number, because the mean of its divisors is an integer number (538317272776).
Almost surely, 22145352660351 is an apocalyptic number.
2145352660351 is a deficient number, since it is larger than the sum of its proper divisors (7916430753).
2145352660351 is an equidigital number, since it uses as much as digits as its factorization.
2145352660351 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7916430752.
The product of its (nonzero) digits is 648000, while the sum is 43.
The spelling of 2145352660351 in words is "two trillion, one hundred forty-five billion, three hundred fifty-two million, six hundred sixty thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •