Base | Representation |
---|---|
bin | 1001001101110101001100… |
… | …0010110100111100010100 |
3 | 1022212201121121020101210112 |
4 | 2103131103002310330110 |
5 | 2312010314100220312 |
6 | 33315045411342152 |
7 | 2064046444125530 |
oct | 223352302647424 |
9 | 38781547211715 |
10 | 10133221101332 |
11 | 325752515926a |
12 | 1177a772b1958 |
13 | 586735479374 |
14 | 270644316bc0 |
15 | 1288c5971d22 |
hex | 937530b4f14 |
10133221101332 has 24 divisors (see below), whose sum is σ = 20266510193664. Its totient is φ = 4342794473952.
The previous prime is 10133221101307. The next prime is 10133221101359. The reversal of 10133221101332 is 23310112233101.
It is a super-2 number, since 2×101332211013322 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10133221101298 and 10133221101307.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 14374733 + ... + 15063179.
It is an arithmetic number, because the mean of its divisors is an integer number (844437924736).
Almost surely, 210133221101332 is an apocalyptic number.
It is an amenable number.
10133221101332 is an abundant number, since it is smaller than the sum of its proper divisors (10133289092332).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10133221101332 is a wasteful number, since it uses less digits than its factorization.
10133221101332 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1214135 (or 1214133 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 10133221101332 its reverse (23310112233101), we get a palindrome (33443333334433).
The spelling of 10133221101332 in words is "ten trillion, one hundred thirty-three billion, two hundred twenty-one million, one hundred one thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •