Base | Representation |
---|---|
bin | 11110001100101100011… |
… | …010010100101101001111 |
3 | 21100101111020211021112010 |
4 | 132030230122110231033 |
5 | 233000014330131111 |
6 | 4225201300312303 |
7 | 302633513344323 |
oct | 36145432245517 |
9 | 7311436737463 |
10 | 2075214302031 |
11 | 730103411182 |
12 | 2962350a2693 |
13 | 1208cc061630 |
14 | 72625bcd983 |
15 | 38eab276aa6 |
hex | 1e32c694b4f |
2075214302031 has 32 divisors (see below), whose sum is σ = 2997685152000. Its totient is φ = 1269393631488.
The previous prime is 2075214301967. The next prime is 2075214302041. The reversal of 2075214302031 is 1302034125702.
It is not a de Polignac number, because 2075214302031 - 26 = 2075214301967 is a prime.
It is a super-3 number, since 3×20752143020313 (a number of 38 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a self number, because there is not a number n which added to its sum of digits gives 2075214302031.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2075214302041) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 17105835 + ... + 17226723.
It is an arithmetic number, because the mean of its divisors is an integer number (93677661000).
Almost surely, 22075214302031 is an apocalyptic number.
2075214302031 is a deficient number, since it is larger than the sum of its proper divisors (922470849969).
2075214302031 is a wasteful number, since it uses less digits than its factorization.
2075214302031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 123543.
The product of its (nonzero) digits is 10080, while the sum is 30.
Adding to 2075214302031 its reverse (1302034125702), we get a palindrome (3377248427733).
The spelling of 2075214302031 in words is "two trillion, seventy-five billion, two hundred fourteen million, three hundred two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •