Base | Representation |
---|---|
bin | 111100001101010… |
… | …110000110000010 |
3 | 2121101201222200111 |
4 | 330031112012002 |
5 | 4032043200310 |
6 | 244122341534 |
7 | 34013655205 |
oct | 7415260602 |
9 | 2541658614 |
10 | 1010131330 |
11 | 47921368a |
12 | 24235a8aa |
13 | 131376760 |
14 | 9822793c |
15 | 5da3328a |
hex | 3c356182 |
1010131330 has 128 divisors (see below), whose sum is σ = 2159861760. Its totient is φ = 336752640.
The previous prime is 1010131327. The next prime is 1010131387. The reversal of 1010131330 is 331310101.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a self number, because there is not a number n which added to its sum of digits gives 1010131330.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 7953727 + ... + 7953853.
It is an arithmetic number, because the mean of its divisors is an integer number (16873920).
Almost surely, 21010131330 is an apocalyptic number.
1010131330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1010131330 is an abundant number, since it is smaller than the sum of its proper divisors (1149730430).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1010131330 is a wasteful number, since it uses less digits than its factorization.
1010131330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 284.
The product of its (nonzero) digits is 27, while the sum is 13.
The square root of 1010131330 is about 31782.5633012820. The cubic root of 1010131330 is about 1003.3657688902.
Adding to 1010131330 its reverse (331310101), we get a palindrome (1341441431).
The spelling of 1010131330 in words is "one billion, ten million, one hundred thirty-one thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •