Base | Representation |
---|---|
bin | 11001101100101100001111… |
… | …001111100001110010000011 |
3 | 112211011211100211001210020211 |
4 | 121230230033033201302003 |
5 | 104303224202422414021 |
6 | 1040213423113014551 |
7 | 32543410311632605 |
oct | 3154541717416203 |
9 | 484154324053224 |
10 | 113022320123011 |
11 | 33015551250722 |
12 | 108145963b4457 |
13 | 4b0ac61078530 |
14 | 1dca449309175 |
15 | d0ee8371b3e1 |
hex | 66cb0f3e1c83 |
113022320123011 has 8 divisors (see below), whose sum is σ = 128122468155920. Its totient is φ = 98837332576992.
The previous prime is 113022320122927. The next prime is 113022320123101. The reversal of 113022320123011 is 110321023220311.
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 113022320123011 - 29 = 113022320122499 is a prime.
It is a super-2 number, since 2×1130223201230112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (113022320123311) 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, 228790121460 + ... + 228790121953.
It is an arithmetic number, because the mean of its divisors is an integer number (16015308519490).
Almost surely, 2113022320123011 is an apocalyptic number.
113022320123011 is a deficient number, since it is larger than the sum of its proper divisors (15100148032909).
113022320123011 is a wasteful number, since it uses less digits than its factorization.
113022320123011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 457580243445.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 113022320123011 its reverse (110321023220311), we get a palindrome (223343343343322).
The spelling of 113022320123011 in words is "one hundred thirteen trillion, twenty-two billion, three hundred twenty million, one hundred twenty-three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •