Base | Representation |
---|---|
bin | 100111000100100… |
… | …1100011011000110 |
3 | 10101100221101012220 |
4 | 1032021030123012 |
5 | 10141111024110 |
6 | 334031553210 |
7 | 44326411506 |
oct | 11611143306 |
9 | 3340841186 |
10 | 1311033030 |
11 | 61305357a |
12 | 30708b806 |
13 | 17b7cbab8 |
14 | c6193a06 |
15 | 7a16e370 |
hex | 4e24c6c6 |
1311033030 has 64 divisors (see below), whose sum is σ = 3348734400. Its totient is φ = 327348224.
The previous prime is 1311033023. The next prime is 1311033043. The reversal of 1311033030 is 303301131.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 93946 + ... + 106994.
It is an arithmetic number, because the mean of its divisors is an integer number (52323975).
Almost surely, 21311033030 is an apocalyptic number.
1311033030 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 1311033030, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1674367200).
1311033030 is an abundant number, since it is smaller than the sum of its proper divisors (2037701370).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1311033030 is a wasteful number, since it uses less digits than its factorization.
1311033030 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13273.
The product of its (nonzero) digits is 81, while the sum is 15.
The square root of 1311033030 is about 36208.1900956123. The cubic root of 1311033030 is about 1094.4717203204.
Adding to 1311033030 its reverse (303301131), we get a palindrome (1614334161).
The spelling of 1311033030 in words is "one billion, three hundred eleven million, thirty-three thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •