Base | Representation |
---|---|
bin | 10011000101000100010… |
… | …000011111111110000100 |
3 | 11122100012112011011010020 |
4 | 103011010100133332010 |
5 | 132440123202414340 |
6 | 2442152105455140 |
7 | 163503350554521 |
oct | 23050420377604 |
9 | 4570175134106 |
10 | 1311110201220 |
11 | 466047589876 |
12 | 1921281a14b0 |
13 | 96838ac78c1 |
14 | 4765ad44148 |
15 | 241894d19d0 |
hex | 1314441ff84 |
1311110201220 has 24 divisors (see below), whose sum is σ = 3671108563584. Its totient is φ = 349629386976.
The previous prime is 1311110201183. The next prime is 1311110201237. The reversal of 1311110201220 is 221020111131.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 1311110201220.
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, 10925918284 + ... + 10925918403.
It is an arithmetic number, because the mean of its divisors is an integer number (152962856816).
Almost surely, 21311110201220 is an apocalyptic number.
1311110201220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1311110201220 is an abundant number, since it is smaller than the sum of its proper divisors (2359998362364).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1311110201220 is a wasteful number, since it uses less digits than its factorization.
1311110201220 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21851836699 (or 21851836697 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 15.
Adding to 1311110201220 its reverse (221020111131), we get a palindrome (1532130312351).
The spelling of 1311110201220 in words is "one trillion, three hundred eleven billion, one hundred ten million, two hundred one thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •