Base | Representation |
---|---|
bin | 111100011010101… |
… | …001111001010011 |
3 | 2121122022020122212 |
4 | 330122221321103 |
5 | 4033441322212 |
6 | 244325222335 |
7 | 34055426150 |
oct | 7432517123 |
9 | 2548266585 |
10 | 1013620307 |
11 | 480186a37 |
12 | 2435619ab |
13 | 131cc883b |
14 | 98895227 |
15 | 5dec1e22 |
hex | 3c6a9e53 |
1013620307 has 8 divisors (see below), whose sum is σ = 1161925632. Its totient is φ = 866190600.
The previous prime is 1013620297. The next prime is 1013620313. The reversal of 1013620307 is 7030263101.
It is a happy number.
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 1013620307 - 26 = 1013620243 is a prime.
It is a super-2 number, since 2×10136203072 = 2054852253525548498, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1013620337) 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 7 ways as a sum of consecutive naturals, for example, 216419 + ... + 221052.
It is an arithmetic number, because the mean of its divisors is an integer number (145240704).
Almost surely, 21013620307 is an apocalyptic number.
1013620307 is a deficient number, since it is larger than the sum of its proper divisors (148305325).
1013620307 is an equidigital number, since it uses as much as digits as its factorization.
1013620307 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 437809.
The product of its (nonzero) digits is 756, while the sum is 23.
The square root of 1013620307 is about 31837.4042126553. The cubic root of 1013620307 is about 1004.5196443735.
Adding to 1013620307 its reverse (7030263101), we get a palindrome (8043883408).
The spelling of 1013620307 in words is "one billion, thirteen million, six hundred twenty thousand, three hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •