Base | Representation |
---|---|
bin | 111101110000001… |
… | …110101011011101 |
3 | 2200012111221211020 |
4 | 331300032223131 |
5 | 4110212200323 |
6 | 250450114353 |
7 | 34450210206 |
oct | 7560165335 |
9 | 2605457736 |
10 | 1036053213 |
11 | 491909128 |
12 | 24ab7b9b9 |
13 | 136851450 |
14 | 9b8545ad |
15 | 60e53ae3 |
hex | 3dc0eadd |
1036053213 has 8 divisors (see below), whose sum is σ = 1487666208. Its totient is φ = 637571184.
The previous prime is 1036053211. The next prime is 1036053247. The reversal of 1036053213 is 3123506301.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1036053213 - 21 = 1036053211 is a prime.
It is a super-3 number, since 3×10360532133 (a number of 28 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1036053211) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13282695 + ... + 13282772.
It is an arithmetic number, because the mean of its divisors is an integer number (185958276).
Almost surely, 21036053213 is an apocalyptic number.
1036053213 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1036053213 is a deficient number, since it is larger than the sum of its proper divisors (451612995).
1036053213 is a wasteful number, since it uses less digits than its factorization.
1036053213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26565483.
The product of its (nonzero) digits is 1620, while the sum is 24.
The square root of 1036053213 is about 32187.7804919817. The cubic root of 1036053213 is about 1011.8761366967.
Adding to 1036053213 its reverse (3123506301), we get a palindrome (4159559514).
The spelling of 1036053213 in words is "one billion, thirty-six million, fifty-three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •