Base | Representation |
---|---|
bin | 111100011000010… |
… | …111110100110001 |
3 | 2121121011211221101 |
4 | 330120113310301 |
5 | 4033313201001 |
6 | 244304324401 |
7 | 34050354625 |
oct | 7430276461 |
9 | 2547154841 |
10 | 1013022001 |
11 | 47a908472 |
12 | 243313701 |
13 | 131b49404 |
14 | 9877b185 |
15 | 5de04a01 |
hex | 3c617d31 |
1013022001 has 8 divisors (see below), whose sum is σ = 1043695080. Its totient is φ = 982522368.
The previous prime is 1013021987. The next prime is 1013022007. The reversal of 1013022001 is 1002203101.
It can be written as a sum of positive squares in 4 ways, for example, as 64320400 + 948701601 = 8020^2 + 30801^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1013022001 - 27 = 1013021873 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1013022007) 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, 31456 + ... + 54913.
It is an arithmetic number, because the mean of its divisors is an integer number (130461885).
Almost surely, 21013022001 is an apocalyptic number.
It is an amenable number.
1013022001 is a deficient number, since it is larger than the sum of its proper divisors (30673079).
1013022001 is an equidigital number, since it uses as much as digits as its factorization.
1013022001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 86723.
The product of its (nonzero) digits is 12, while the sum is 10.
The square root of 1013022001 is about 31828.0065508351. The cubic root of 1013022001 is about 1004.3219607449.
Adding to 1013022001 its reverse (1002203101), we get a palindrome (2015225102).
It can be divided in two parts, 10130 and 22001, that added together give a triangular number (32131 = T253).
The spelling of 1013022001 in words is "one billion, thirteen million, twenty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •