Base | Representation |
---|---|
bin | 100111101010101… |
… | …1001110111010110 |
3 | 10102202112100212211 |
4 | 1033111121313112 |
5 | 10211214323110 |
6 | 340024104034 |
7 | 44661256426 |
oct | 11725316726 |
9 | 3382470784 |
10 | 1331011030 |
11 | 623359318 |
12 | 31190501a |
13 | 1829a51bb |
14 | c8ab4486 |
15 | 7bcb898a |
hex | 4f559dd6 |
1331011030 has 8 divisors (see below), whose sum is σ = 2395819872. Its totient is φ = 532404408.
The previous prime is 1331011007. The next prime is 1331011037. The reversal of 1331011030 is 301101331.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a self number, because there is not a number n which added to its sum of digits gives 1331011030.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1331011037) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 66550542 + ... + 66550561.
It is an arithmetic number, because the mean of its divisors is an integer number (299477484).
Almost surely, 21331011030 is an apocalyptic number.
1331011030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1331011030 is a deficient number, since it is larger than the sum of its proper divisors (1064808842).
1331011030 is a wasteful number, since it uses less digits than its factorization.
1331011030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 133101110.
The product of its (nonzero) digits is 27, while the sum is 13.
The square root of 1331011030 is about 36483.0238604203. The cubic root of 1331011030 is about 1100.0030385591.
Adding to 1331011030 its reverse (301101331), we get a palindrome (1632112361).
The spelling of 1331011030 in words is "one billion, three hundred thirty-one million, eleven thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •