Base | Representation |
---|---|
bin | 100111000100101… |
… | …1100110110101010 |
3 | 10101101001210112111 |
4 | 1032021130312222 |
5 | 10141120202310 |
6 | 334033232534 |
7 | 44330111641 |
oct | 11611346652 |
9 | 3341053474 |
10 | 1311100330 |
11 | 61309a0a1 |
12 | 30710274a |
13 | 17b823617 |
14 | c61b0358 |
15 | 7a18428a |
hex | 4e25cdaa |
1311100330 has 8 divisors (see below), whose sum is σ = 2359980612. Its totient is φ = 524440128.
The previous prime is 1311100327. The next prime is 1311100331. The reversal of 1311100330 is 330011131.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 1311091681 + 8649 = 36209^2 + 93^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×13111003302 = 3437968150652217800, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1311100330.
It is not an unprimeable number, because it can be changed into a prime (1311100331) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 65555007 + ... + 65555026.
Almost surely, 21311100330 is an apocalyptic number.
1311100330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1311100330 is a deficient number, since it is larger than the sum of its proper divisors (1048880282).
1311100330 is a wasteful number, since it uses less digits than its factorization.
1311100330 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 131110040.
The product of its (nonzero) digits is 27, while the sum is 13.
The square root of 1311100330 is about 36209.1194314361. The cubic root of 1311100330 is about 1094.4904477119.
Adding to 1311100330 its reverse (330011131), we get a palindrome (1641111461).
The spelling of 1311100330 in words is "one billion, three hundred eleven million, one hundred thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •