Base | Representation |
---|---|
bin | 1001010010111100101011… |
… | …1101011110111010100110 |
3 | 1100012010112021200121221112 |
4 | 2110233022331132322212 |
5 | 2314430334332442410 |
6 | 33423305013545022 |
7 | 2103311121110120 |
oct | 224571275367246 |
9 | 40163467617845 |
10 | 10221132312230 |
11 | 32908377a9174 |
12 | 1190b10645172 |
13 | 591b05607558 |
14 | 2749c3a46210 |
15 | 12ad1d74d105 |
hex | 94bcaf5eea6 |
10221132312230 has 64 divisors (see below), whose sum is σ = 22263809247360. Its totient is φ = 3298153365504.
The previous prime is 10221132312229. The next prime is 10221132312289. The reversal of 10221132312230 is 3221323112201.
It is a super-2 number, since 2×102211323122302 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10221132312196 and 10221132312205.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 50107886 + ... + 50311454.
It is an arithmetic number, because the mean of its divisors is an integer number (347872019490).
Almost surely, 210221132312230 is an apocalyptic number.
10221132312230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10221132312230 is an abundant number, since it is smaller than the sum of its proper divisors (12042676935130).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10221132312230 is a wasteful number, since it uses less digits than its factorization.
10221132312230 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 245793.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 10221132312230 its reverse (3221323112201), we get a palindrome (13442455424431).
The spelling of 10221132312230 in words is "ten trillion, two hundred twenty-one billion, one hundred thirty-two million, three hundred twelve thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •