Base | Representation |
---|---|
bin | 1001001100100110111011… |
… | …0100101110011101011011 |
3 | 1022210201101110112020212212 |
4 | 2103021232310232131123 |
5 | 2311134302324032311 |
6 | 33301253004425335 |
7 | 2062404022410356 |
oct | 223115664563533 |
9 | 38721343466785 |
10 | 10112212330331 |
11 | 3249624265701 |
12 | 117399354824b |
13 | 584767ab3217 |
14 | 26d61007d29d |
15 | 128096390c8b |
hex | 9326ed2e75b |
10112212330331 has 16 divisors (see below), whose sum is σ = 10201713708960. Its totient is φ = 10023131220480.
The previous prime is 10112212330313. The next prime is 10112212330357. The reversal of 10112212330331 is 13303321221101.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10112212330331 is a prime.
It is a super-2 number, since 2×101122123303312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10112212330297 and 10112212330306.
It is not an unprimeable number, because it can be changed into a prime (10112212330931) 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, 158723075 + ... + 158786771.
It is an arithmetic number, because the mean of its divisors is an integer number (637607106810).
Almost surely, 210112212330331 is an apocalyptic number.
10112212330331 is a deficient number, since it is larger than the sum of its proper divisors (89501378629).
10112212330331 is a wasteful number, since it uses less digits than its factorization.
10112212330331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66974.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 10112212330331 its reverse (13303321221101), we get a palindrome (23415533551432).
The spelling of 10112212330331 in words is "ten trillion, one hundred twelve billion, two hundred twelve million, three hundred thirty thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •