Base | Representation |
---|---|
bin | 111100010010000… |
… | …011100110111010 |
3 | 2121111001201210020 |
4 | 330102003212322 |
5 | 4032402210310 |
6 | 244205031310 |
7 | 34030320612 |
oct | 7422034672 |
9 | 2544051706 |
10 | 1011366330 |
11 | 479987547 |
12 | 242855536 |
13 | 1316b9920 |
14 | 98469a42 |
15 | 5dbc9170 |
hex | 3c4839ba |
1011366330 has 32 divisors (see below), whose sum is σ = 2613993984. Its totient is φ = 248951616.
The previous prime is 1011366313. The next prime is 1011366331. The reversal of 1011366330 is 336631101.
1011366330 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a self number, because there is not a number n which added to its sum of digits gives 1011366330.
It is not an unprimeable number, because it can be changed into a prime (1011366331) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1296234 + ... + 1297013.
It is an arithmetic number, because the mean of its divisors is an integer number (81687312).
Almost surely, 21011366330 is an apocalyptic number.
1011366330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1011366330 is an abundant number, since it is smaller than the sum of its proper divisors (1602627654).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1011366330 is a wasteful number, since it uses less digits than its factorization.
1011366330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2593270.
The product of its (nonzero) digits is 972, while the sum is 24.
The square root of 1011366330 is about 31801.9862587229. The cubic root of 1011366330 is about 1003.7745118022.
Adding to 1011366330 its reverse (336631101), we get a palindrome (1347997431).
The spelling of 1011366330 in words is "one billion, eleven million, three hundred sixty-six thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •