Base | Representation |
---|---|
bin | 11101011111010001101… |
… | …00001111001000001000 |
3 | 10120212022021102210022011 |
4 | 32233220310033020020 |
5 | 113100040132301440 |
6 | 2053245100105304 |
7 | 133126422064402 |
oct | 16575064171010 |
9 | 3525267383264 |
10 | 1013223322120 |
11 | 360784172589 |
12 | 144452535234 |
13 | 747149cc0b9 |
14 | 3707c705b72 |
15 | 1b5525cc9ea |
hex | ebe8d0f208 |
1013223322120 has 32 divisors (see below), whose sum is σ = 2279826259200. Its totient is φ = 405276211648.
The previous prime is 1013223322093. The next prime is 1013223322141. The reversal of 1013223322120 is 212233223101.
It is a junction number, because it is equal to n+sod(n) for n = 1013223322091 and 1013223322100.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 892527 + ... + 1680193.
It is an arithmetic number, because the mean of its divisors is an integer number (71244570600).
Almost surely, 21013223322120 is an apocalyptic number.
1013223322120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1013223322120 is an abundant number, since it is smaller than the sum of its proper divisors (1266602937080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1013223322120 is a wasteful number, since it uses less digits than its factorization.
1013223322120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 819837 (or 819833 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 1013223322120 its reverse (212233223101), we get a palindrome (1225456545221).
The spelling of 1013223322120 in words is "one trillion, thirteen billion, two hundred twenty-three million, three hundred twenty-two thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •