Base | Representation |
---|---|
bin | 111100011000101… |
… | …111110011101110 |
3 | 2121121100211200210 |
4 | 330120233303232 |
5 | 4033324321423 |
6 | 244310403250 |
7 | 34051244214 |
oct | 7430576356 |
9 | 2547324623 |
10 | 1013120238 |
11 | 47a975259 |
12 | 243360526 |
13 | 131b82040 |
14 | 987a4cb4 |
15 | 5de23b93 |
hex | 3c62fcee |
1013120238 has 64 divisors (see below), whose sum is σ = 2350559232. Its totient is φ = 288541440.
The previous prime is 1013120231. The next prime is 1013120243. The reversal of 1013120238 is 8320213101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1013120231) 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, 46506 + ... + 64722.
It is an arithmetic number, because the mean of its divisors is an integer number (36727488).
Almost surely, 21013120238 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1013120238, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1175279616).
1013120238 is an abundant number, since it is smaller than the sum of its proper divisors (1337438994).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1013120238 is a wasteful number, since it uses less digits than its factorization.
1013120238 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18289.
The product of its (nonzero) digits is 288, while the sum is 21.
The square root of 1013120238 is about 31829.5497611889. The cubic root of 1013120238 is about 1004.3544241357.
Adding to 1013120238 its reverse (8320213101), we get a palindrome (9333333339).
The spelling of 1013120238 in words is "one billion, thirteen million, one hundred twenty thousand, two hundred thirty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •