Base | Representation |
---|---|
bin | 111101101001010… |
… | …100110011100101 |
3 | 2200002010000002110 |
4 | 331221110303211 |
5 | 4104231241201 |
6 | 250343231233 |
7 | 34425631410 |
oct | 7551246345 |
9 | 2602100073 |
10 | 1034243301 |
11 | 490892333 |
12 | 24a448519 |
13 | 1363696b0 |
14 | 9b502b77 |
15 | 60be76d6 |
hex | 3da54ce5 |
1034243301 has 32 divisors (see below), whose sum is σ = 1703939328. Its totient is φ = 543375360.
The previous prime is 1034243299. The next prime is 1034243303. The reversal of 1034243301 is 1033424301.
It is an interprime number because it is at equal distance from previous prime (1034243299) and next prime (1034243303).
It is not a de Polignac number, because 1034243301 - 21 = 1034243299 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 (1034243303) 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 31 ways as a sum of consecutive naturals, for example, 62791 + ... + 77531.
It is an arithmetic number, because the mean of its divisors is an integer number (53248104).
Almost surely, 21034243301 is an apocalyptic number.
It is an amenable number.
1034243301 is a deficient number, since it is larger than the sum of its proper divisors (669696027).
1034243301 is a wasteful number, since it uses less digits than its factorization.
1034243301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15021.
The product of its (nonzero) digits is 864, while the sum is 21.
The square root of 1034243301 is about 32159.6533096985. The cubic root of 1034243301 is about 1011.2865678014.
Adding to 1034243301 its reverse (1033424301), we get a palindrome (2067667602).
The spelling of 1034243301 in words is "one billion, thirty-four million, two hundred forty-three thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •