Base | Representation |
---|---|
bin | 10000001100110110101… |
… | …000111001100110100110 |
3 | 10221102122201020110200010 |
4 | 100030312220321212212 |
5 | 121220031141033110 |
6 | 2211240554031050 |
7 | 143301640145013 |
oct | 20146650714646 |
9 | 3842581213603 |
10 | 1113313221030 |
11 | 39a17631aaaa |
12 | 15b926418486 |
13 | 80ca602675a |
14 | 3bc5568870a |
15 | 1de5e674020 |
hex | 10336a399a6 |
1113313221030 has 32 divisors (see below), whose sum is σ = 2764087999200. Its totient is φ = 286646162432.
The previous prime is 1113313221029. The next prime is 1113313221047. The reversal of 1113313221030 is 301223133111.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 1113313220988 and 1113313221006.
It is a congruent number.
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 15 ways as a sum of consecutive naturals, for example, 639834315 + ... + 639836054.
It is an arithmetic number, because the mean of its divisors is an integer number (86377749975).
Almost surely, 21113313221030 is an apocalyptic number.
1113313221030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1113313221030 is an abundant number, since it is smaller than the sum of its proper divisors (1650774778170).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1113313221030 is a wasteful number, since it uses less digits than its factorization.
1113313221030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1279670408.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 1113313221030 its reverse (301223133111), we get a palindrome (1414536354141).
The spelling of 1113313221030 in words is "one trillion, one hundred thirteen billion, three hundred thirteen million, two hundred twenty-one thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •