Base | Representation |
---|---|
bin | 11101011110111000010… |
… | …10010101101001111100 |
3 | 10120211202110221022212112 |
4 | 32233130022111221330 |
5 | 113044121304342340 |
6 | 2053212033353152 |
7 | 133121233350164 |
oct | 16573412255174 |
9 | 3524673838775 |
10 | 1013011012220 |
11 | 360685341a59 |
12 | 1443b34087b8 |
13 | 746aca24a3c |
14 | 3705c43b5a4 |
15 | 1b53db41065 |
hex | ebdc295a7c |
1013011012220 has 24 divisors (see below), whose sum is σ = 2132400286800. Its totient is φ = 404237326592.
The previous prime is 1013011012193. The next prime is 1013011012231. The reversal of 1013011012220 is 222101103101.
It is a junction number, because it is equal to n+sod(n) for n = 1013011012195 and 1013011012204.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 60433805 + ... + 60450564.
It is an arithmetic number, because the mean of its divisors is an integer number (88850011950).
Almost surely, 21013011012220 is an apocalyptic number.
1013011012220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1013011012220 is an abundant number, since it is smaller than the sum of its proper divisors (1119389274580).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1013011012220 is a wasteful number, since it uses less digits than its factorization.
1013011012220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 120884797 (or 120884795 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 1013011012220 its reverse (222101103101), we get a palindrome (1235112115321).
The spelling of 1013011012220 in words is "one trillion, thirteen billion, eleven million, twelve thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •