Base | Representation |
---|---|
bin | 111101100101011… |
… | …101100010110001 |
3 | 2200000012112210210 |
4 | 331211131202301 |
5 | 4104001334023 |
6 | 250305414333 |
7 | 34414212600 |
oct | 7545354261 |
9 | 2600175723 |
10 | 1033230513 |
11 | 490260417 |
12 | 24a03a3a9 |
13 | 1360a3703 |
14 | 9b31ba37 |
15 | 60a97593 |
hex | 3d95d8b1 |
1033230513 has 24 divisors (see below), whose sum is σ = 1645882752. Its totient is φ = 574457184.
The previous prime is 1033230509. The next prime is 1033230521. The reversal of 1033230513 is 3150323301.
It is not a de Polignac number, because 1033230513 - 22 = 1033230509 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a self number, because there is not a number n which added to its sum of digits gives 1033230513.
It is not an unprimeable number, because it can be changed into a prime (1033230593) 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 23 ways as a sum of consecutive naturals, for example, 89545 + ... + 100422.
It is an arithmetic number, because the mean of its divisors is an integer number (68578448).
Almost surely, 21033230513 is an apocalyptic number.
It is an amenable number.
1033230513 is a deficient number, since it is larger than the sum of its proper divisors (612652239).
1033230513 is a wasteful number, since it uses less digits than its factorization.
1033230513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 190021 (or 190014 counting only the distinct ones).
The product of its (nonzero) digits is 810, while the sum is 21.
The square root of 1033230513 is about 32143.9032010738. The cubic root of 1033230513 is about 1010.9563574904.
Adding to 1033230513 its reverse (3150323301), we get a palindrome (4183553814).
The spelling of 1033230513 in words is "one billion, thirty-three million, two hundred thirty thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •