Base | Representation |
---|---|
bin | 10010101110101101110100… |
… | …011111010000011111000111 |
3 | 101210122222121120222002202110 |
4 | 102232231310133100133013 |
5 | 41244113232310333111 |
6 | 451110340244512103 |
7 | 23231256365051511 |
oct | 2256556437203707 |
9 | 353588546862673 |
10 | 82375132121031 |
11 | 2427a108626832 |
12 | 92a4a290ab633 |
13 | 36c6c319aa429 |
14 | 164ad98a12bb1 |
15 | 97cb760395a6 |
hex | 4aeb747d07c7 |
82375132121031 has 8 divisors (see below), whose sum is σ = 109835053403760. Its totient is φ = 54915982792832.
The previous prime is 82375132121027. The next prime is 82375132121041. The reversal of 82375132121031 is 13012123157328.
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 82375132121031 - 22 = 82375132121027 is a prime.
It is a super-2 number, since 2×823751321210312 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (82375132121011) 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, 192739596 + ... + 193166513.
It is an arithmetic number, because the mean of its divisors is an integer number (13729381675470).
Almost surely, 282375132121031 is an apocalyptic number.
82375132121031 is a deficient number, since it is larger than the sum of its proper divisors (27459921282729).
82375132121031 is a wasteful number, since it uses less digits than its factorization.
82375132121031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 385977265.
The product of its (nonzero) digits is 60480, while the sum is 39.
Adding to 82375132121031 its reverse (13012123157328), we get a palindrome (95387255278359).
The spelling of 82375132121031 in words is "eighty-two trillion, three hundred seventy-five billion, one hundred thirty-two million, one hundred twenty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •