Base | Representation |
---|---|
bin | 10000011100100001001… |
… | …100000010000110110010 |
3 | 11000001001220222222222110 |
4 | 100130201030002012302 |
5 | 122004003044420310 |
6 | 2223102004350150 |
7 | 144435516466320 |
oct | 20344114020662 |
9 | 4001056888873 |
10 | 1130133201330 |
11 | 3a6317803171 |
12 | 16303b3a5356 |
13 | 8275693a013 |
14 | 3c9ad4a6d10 |
15 | 1e5e613bd20 |
hex | 107213021b2 |
1130133201330 has 64 divisors (see below), whose sum is σ = 3100048588800. Its totient is φ = 258294938304.
The previous prime is 1130133201311. The next prime is 1130133201331. The reversal of 1130133201330 is 331023310311.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 1130133201297 and 1130133201306.
It is not an unprimeable number, because it can be changed into a prime (1130133201331) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2415871 + ... + 2845469.
It is an arithmetic number, because the mean of its divisors is an integer number (48438259200).
Almost surely, 21130133201330 is an apocalyptic number.
1130133201330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1130133201330 is an abundant number, since it is smaller than the sum of its proper divisors (1969915387470).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1130133201330 is a wasteful number, since it uses less digits than its factorization.
1130133201330 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 442143.
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 1130133201330 its reverse (331023310311), we get a palindrome (1461156511641).
The spelling of 1130133201330 in words is "one trillion, one hundred thirty billion, one hundred thirty-three million, two hundred one thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •