Base | Representation |
---|---|
bin | 111011101100000… |
… | …010010001101101 |
3 | 2120210022100201212 |
4 | 323230002101231 |
5 | 4022324240110 |
6 | 243211244205 |
7 | 33546516536 |
oct | 7354022155 |
9 | 2523270655 |
10 | 1001399405 |
11 | 47429a216 |
12 | 23b449665 |
13 | 12c60a136 |
14 | 96dd368d |
15 | 5cdaae05 |
hex | 3bb0246d |
1001399405 has 8 divisors (see below), whose sum is σ = 1201873272. Its totient is φ = 800990208.
The previous prime is 1001399401. The next prime is 1001399423. The reversal of 1001399405 is 5049931001.
1001399405 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 130736356 + 870663049 = 11434^2 + 29507^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 1001399405 - 22 = 1001399401 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1001399401) 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, 29777 + ... + 53753.
It is an arithmetic number, because the mean of its divisors is an integer number (150234159).
Almost surely, 21001399405 is an apocalyptic number.
It is an amenable number.
1001399405 is a deficient number, since it is larger than the sum of its proper divisors (200473867).
1001399405 is an equidigital number, since it uses as much as digits as its factorization.
1001399405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32335.
The product of its (nonzero) digits is 4860, while the sum is 32.
The square root of 1001399405 is about 31644.8954019444. The cubic root of 1001399405 is about 1000.4662509096.
The spelling of 1001399405 in words is "one billion, one million, three hundred ninety-nine thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •