Base | Representation |
---|---|
bin | 1001011001010011011010… |
… | …0001111011110010111101 |
3 | 1100120120100011001101212011 |
4 | 2112110312201323302331 |
5 | 2323222434132242341 |
6 | 33545402432411221 |
7 | 2114224512334030 |
oct | 226246641736275 |
9 | 40516304041764 |
10 | 10330311212221 |
11 | 3323073406730 |
12 | 11aa1003a6b11 |
13 | 59c1b4974560 |
14 | 279dbdb6b017 |
15 | 12daad701b81 |
hex | 9653687bcbd |
10330311212221 has 32 divisors (see below), whose sum is σ = 13935803406336. Its totient is φ = 7395178392000.
The previous prime is 10330311212201. The next prime is 10330311212269. The reversal of 10330311212221 is 12221211303301.
It is not a de Polignac number, because 10330311212221 - 213 = 10330311204029 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10330311212192 and 10330311212201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10330311212201) 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, 24243745 + ... + 24666166.
It is an arithmetic number, because the mean of its divisors is an integer number (435493856448).
Almost surely, 210330311212221 is an apocalyptic number.
10330311212221 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10330311212221 is a deficient number, since it is larger than the sum of its proper divisors (3605492194115).
10330311212221 is a wasteful number, since it uses less digits than its factorization.
10330311212221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48910153.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 10330311212221 its reverse (12221211303301), we get a palindrome (22551522515522).
The spelling of 10330311212221 in words is "ten trillion, three hundred thirty billion, three hundred eleven million, two hundred twelve thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •