Base | Representation |
---|---|
bin | 11101011111000100011… |
… | …00110011010011000101 |
3 | 10120212000112120100200202 |
4 | 32233202030303103011 |
5 | 113044323223234341 |
6 | 2053230053020245 |
7 | 133123603433540 |
oct | 16574214632305 |
9 | 3525015510622 |
10 | 1013112321221 |
11 | 360727547a00 |
12 | 144421324685 |
13 | 746c7a062b0 |
14 | 3706ba8d857 |
15 | 1b5479a379b |
hex | ebe23334c5 |
1013112321221 has 48 divisors (see below), whose sum is σ = 1371507967872. Its totient is φ = 728212256640.
The previous prime is 1013112321211. The next prime is 1013112321229. The reversal of 1013112321221 is 1221232113101.
It is not a de Polignac number, because 1013112321221 - 226 = 1013045212357 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1013112321193 and 1013112321202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1013112321229) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 16408610 + ... + 16470236.
It is an arithmetic number, because the mean of its divisors is an integer number (28573082664).
Almost surely, 21013112321221 is an apocalyptic number.
1013112321221 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1013112321221 is a deficient number, since it is larger than the sum of its proper divisors (358395646651).
1013112321221 is a wasteful number, since it uses less digits than its factorization.
1013112321221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 63162 (or 63151 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 1013112321221 its reverse (1221232113101), we get a palindrome (2234344434322).
The spelling of 1013112321221 in words is "one trillion, thirteen billion, one hundred twelve million, three hundred twenty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •