Base | Representation |
---|---|
bin | 11001101100101100111111… |
… | …000110010011000111100101 |
3 | 112211011220102202211200011202 |
4 | 121230230333012103013211 |
5 | 104303232323442310041 |
6 | 1040214034513412245 |
7 | 32543436231232220 |
oct | 3154547706230745 |
9 | 484156382750152 |
10 | 113023123010021 |
11 | 33015923483604 |
12 | 1081477b26a085 |
13 | 4b0b05b4cc4c3 |
14 | 1dca4c3bc65b7 |
15 | d0eecde63a9b |
hex | 66cb3f1931e5 |
113023123010021 has 16 divisors (see below), whose sum is σ = 130241858740224. Its totient is φ = 96075834729264.
The previous prime is 113023123009999. The next prime is 113023123010041. The reversal of 113023123010021 is 120010321320311.
It is a happy number.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-113023123010021 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 113023123009975 and 113023123010002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113023123010041) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 137240231 + ... + 138061316.
It is an arithmetic number, because the mean of its divisors is an integer number (8140116171264).
Almost surely, 2113023123010021 is an apocalyptic number.
It is an amenable number.
113023123010021 is a deficient number, since it is larger than the sum of its proper divisors (17218735730203).
113023123010021 is a wasteful number, since it uses less digits than its factorization.
113023123010021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 275302040.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 113023123010021 its reverse (120010321320311), we get a palindrome (233033444330332).
The spelling of 113023123010021 in words is "one hundred thirteen trillion, twenty-three billion, one hundred twenty-three million, ten thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •