Base | Representation |
---|---|
bin | 11101011001010010101… |
… | …10101100110111000010 |
3 | 10120120000102010120220220 |
4 | 32230221112230313002 |
5 | 113022000322200310 |
6 | 2051554231443510 |
7 | 132654005651565 |
oct | 16545126546702 |
9 | 3516012116826 |
10 | 1010011131330 |
11 | 35a385a53053 |
12 | 1438b6826596 |
13 | 743223827a6 |
14 | 36c55c664dc |
15 | 1b4155c2670 |
hex | eb295acdc2 |
1010011131330 has 128 divisors (see below), whose sum is σ = 2635593811200. Its totient is φ = 246766141440.
The previous prime is 1010011131329. The next prime is 1010011131377. The reversal of 1010011131330 is 331311100101.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 2850321 + ... + 3185019.
It is an arithmetic number, because the mean of its divisors is an integer number (20590576650).
Almost surely, 21010011131330 is an apocalyptic number.
1010011131330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 1010011131330, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1317796905600).
1010011131330 is an abundant number, since it is smaller than the sum of its proper divisors (1625582679870).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1010011131330 is a wasteful number, since it uses less digits than its factorization.
1010011131330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 334884.
The product of its (nonzero) digits is 27, while the sum is 15.
Adding to 1010011131330 its reverse (331311100101), we get a palindrome (1341322231431).
The spelling of 1010011131330 in words is "one trillion, ten billion, eleven million, one hundred thirty-one thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •