Base | Representation |
---|---|
bin | 11111000011011110001… |
… | …010010110001100100101 |
3 | 21120000022021212210111001 |
4 | 133003132022112030211 |
5 | 234430443421030000 |
6 | 4312205455113301 |
7 | 310115164326415 |
oct | 37033612261445 |
9 | 7500267783431 |
10 | 2134031033125 |
11 | 75304597a852 |
12 | 2a570a812831 |
13 | 1263136048b4 |
14 | 7540546a645 |
15 | 3a79eb9646a |
hex | 1f0de296325 |
2134031033125 has 10 divisors (see below), whose sum is σ = 2666685179774. Its totient is φ = 1707224826000.
The previous prime is 2134031033089. The next prime is 2134031033171. The reversal of 2134031033125 is 5213301304312.
It can be written as a sum of positive squares in 5 ways, for example, as 418352827204 + 1715678205921 = 646802^2 + 1309839^2 .
It is not a de Polignac number, because 2134031033125 - 27 = 2134031032997 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2134031033093 and 2134031033102.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 1707224202 + ... + 1707225451.
Almost surely, 22134031033125 is an apocalyptic number.
2134031033125 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
2134031033125 is a deficient number, since it is larger than the sum of its proper divisors (532654146649).
2134031033125 is an frugal number, since it uses more digits than its factorization.
2134031033125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3414449673 (or 3414449658 counting only the distinct ones).
The product of its (nonzero) digits is 6480, while the sum is 28.
Adding to 2134031033125 its reverse (5213301304312), we get a palindrome (7347332337437).
The spelling of 2134031033125 in words is "two trillion, one hundred thirty-four billion, thirty-one million, thirty-three thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •