Base | Representation |
---|---|
bin | 111011110010101… |
… | …001010001101101 |
3 | 2120220120101102112 |
4 | 323302221101231 |
5 | 4023300211023 |
6 | 243312333405 |
7 | 33600324062 |
oct | 7362512155 |
9 | 2526511375 |
10 | 1003132013 |
11 | 475272a24 |
12 | 23bb44265 |
13 | 12ca95950 |
14 | 97324c69 |
15 | 5d0ee478 |
hex | 3bca946d |
1003132013 has 8 divisors (see below), whose sum is σ = 1080877056. Its totient is φ = 925470000.
The previous prime is 1003132001. The next prime is 1003132019. The reversal of 1003132013 is 3102313001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1003132013 - 220 = 1002083437 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1003132019) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5588 + ... + 45138.
It is an arithmetic number, because the mean of its divisors is an integer number (135109632).
Almost surely, 21003132013 is an apocalyptic number.
1003132013 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1003132013 is a deficient number, since it is larger than the sum of its proper divisors (77745043).
1003132013 is a wasteful number, since it uses less digits than its factorization.
1003132013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41515.
The product of its (nonzero) digits is 54, while the sum is 14.
The square root of 1003132013 is about 31672.2593605193. The cubic root of 1003132013 is about 1001.0429162808.
Adding to 1003132013 its reverse (3102313001), we get a palindrome (4105445014).
The spelling of 1003132013 in words is "one billion, three million, one hundred thirty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •