Base | Representation |
---|---|
bin | 100111101001100… |
… | …1100101111110101 |
3 | 10102201102222222210 |
4 | 1033103030233311 |
5 | 10211042324023 |
6 | 340003444033 |
7 | 44653331310 |
oct | 11723145765 |
9 | 3381388883 |
10 | 1330433013 |
11 | 622aa4018 |
12 | 311686619 |
13 | 182832090 |
14 | c89a3977 |
15 | 7bc02593 |
hex | 4f4ccbf5 |
1330433013 has 32 divisors (see below), whose sum is σ = 2242299136. Its totient is φ = 682795008.
The previous prime is 1330432993. The next prime is 1330433051. The reversal of 1330433013 is 3103340331.
It is not a de Polignac number, because 1330433013 - 212 = 1330428917 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1330433053) 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 31 ways as a sum of consecutive naturals, for example, 55756 + ... + 75957.
It is an arithmetic number, because the mean of its divisors is an integer number (70071848).
Almost surely, 21330433013 is an apocalyptic number.
1330433013 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1330433013 is a deficient number, since it is larger than the sum of its proper divisors (911866123).
1330433013 is a wasteful number, since it uses less digits than its factorization.
1330433013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 131773.
The product of its (nonzero) digits is 972, while the sum is 21.
The square root of 1330433013 is about 36475.1012747052. The cubic root of 1330433013 is about 1099.8437830500.
Adding to 1330433013 its reverse (3103340331), we get a palindrome (4433773344).
The spelling of 1330433013 in words is "one billion, three hundred thirty million, four hundred thirty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •