Base | Representation |
---|---|
bin | 11101101101111110001… |
… | …01011001001100000100 |
3 | 10121121200010110121101020 |
4 | 32312333011121030010 |
5 | 113212214424030200 |
6 | 2101032021431140 |
7 | 133526064144252 |
oct | 16667705311404 |
9 | 3547603417336 |
10 | 1021113111300 |
11 | 364062804a07 |
12 | 145a9486b4b0 |
13 | 753a1464bc9 |
14 | 375ca4c15d2 |
15 | 1b8650a7ea0 |
hex | edbf159304 |
1021113111300 has 36 divisors (see below), whose sum is σ = 2954420602896. Its totient is φ = 272296829600.
The previous prime is 1021113111269. The next prime is 1021113111323. The reversal of 1021113111300 is 31113111201.
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 1021113111300.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1701854886 + ... + 1701855485.
Almost surely, 21021113111300 is an apocalyptic number.
1021113111300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1021113111300 is an abundant number, since it is smaller than the sum of its proper divisors (1933307491596).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1021113111300 is a wasteful number, since it uses less digits than its factorization.
1021113111300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3403710388 (or 3403710381 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 15.
Adding to 1021113111300 its reverse (31113111201), we get a palindrome (1052226222501).
Subtracting from 1021113111300 its reverse (31113111201), we obtain a palindrome (990000000099).
The spelling of 1021113111300 in words is "one trillion, twenty-one billion, one hundred thirteen million, one hundred eleven thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •