Base | Representation |
---|---|
bin | 10000001100110110101… |
… | …001010010010000101110 |
3 | 10221102122201102121012212 |
4 | 100030312221102100232 |
5 | 121220031202301110 |
6 | 2211241000130422 |
7 | 143301641045330 |
oct | 20146651222056 |
9 | 3842581377185 |
10 | 1113313322030 |
11 | 39a176389978 |
12 | 15b926466a12 |
13 | 80ca6060710 |
14 | 3bc556b3450 |
15 | 1de5e693e05 |
hex | 10336a5242e |
1113313322030 has 64 divisors (see below), whose sum is σ = 2518894264320. Its totient is φ = 344848593024.
The previous prime is 1113313321969. The next prime is 1113313322071. The reversal of 1113313322030 is 302233133111.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1113313321987 and 1113313322005.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 12972350 + ... + 13057889.
It is an arithmetic number, because the mean of its divisors is an integer number (39357722880).
Almost surely, 21113313322030 is an apocalyptic number.
1113313322030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1113313322030 is an abundant number, since it is smaller than the sum of its proper divisors (1405580942290).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1113313322030 is a wasteful number, since it uses less digits than its factorization.
1113313322030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26030313.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 1113313322030 its reverse (302233133111), we get a palindrome (1415546455141).
The spelling of 1113313322030 in words is "one trillion, one hundred thirteen billion, three hundred thirteen million, three hundred twenty-two thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •