Base | Representation |
---|---|
bin | 11111000011011100100… |
… | …011010110001110111101 |
3 | 21120000020102002000111212 |
4 | 133003130203112032331 |
5 | 234430420013014240 |
6 | 4312203052254205 |
7 | 310114415662265 |
oct | 37033443261675 |
9 | 7500212060455 |
10 | 2134004032445 |
11 | 75303170883a |
12 | 2a5701771365 |
13 | 12630ab3cb6c |
14 | 75401a3c7a5 |
15 | 3a79c611165 |
hex | 1f0dc8d63bd |
2134004032445 has 4 divisors (see below), whose sum is σ = 2560804838940. Its totient is φ = 1707203225952.
The previous prime is 2134004032421. The next prime is 2134004032451. The reversal of 2134004032445 is 5442304004312.
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 1530817256644 + 603186775801 = 1237262^2 + 776651^2 .
It is a cyclic number.
It is not a de Polignac number, because 2134004032445 - 28 = 2134004032189 is a prime.
It is a super-2 number, since 2×21340040324452 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 213400403240 + ... + 213400403249.
It is an arithmetic number, because the mean of its divisors is an integer number (640201209735).
Almost surely, 22134004032445 is an apocalyptic number.
It is an amenable number.
2134004032445 is a deficient number, since it is larger than the sum of its proper divisors (426800806495).
2134004032445 is an equidigital number, since it uses as much as digits as its factorization.
2134004032445 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 426800806494.
The product of its (nonzero) digits is 46080, while the sum is 32.
Adding to 2134004032445 its reverse (5442304004312), we get a palindrome (7576308036757).
The spelling of 2134004032445 in words is "two trillion, one hundred thirty-four billion, four million, thirty-two thousand, four hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •