Base | Representation |
---|---|
bin | 10100001110100100100… |
… | …010010011011101000111 |
3 | 11220212220220212220000120 |
4 | 110032210202103131013 |
5 | 140233242413030430 |
6 | 2542323451513023 |
7 | 202266234431565 |
oct | 24164442233507 |
9 | 4825826786016 |
10 | 1390034892615 |
11 | 496568505656 |
12 | 1a5493a58773 |
13 | a1106215625 |
14 | 4b3c6d6aa35 |
15 | 26258395610 |
hex | 143a4893747 |
1390034892615 has 8 divisors (see below), whose sum is σ = 2224055828208. Its totient is φ = 741351942720.
The previous prime is 1390034892599. The next prime is 1390034892661. The reversal of 1390034892615 is 5162984300931.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1390034892615 - 24 = 1390034892599 is a prime.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 46334496406 + ... + 46334496435.
It is an arithmetic number, because the mean of its divisors is an integer number (278006978526).
Almost surely, 21390034892615 is an apocalyptic number.
1390034892615 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
1390034892615 is a deficient number, since it is larger than the sum of its proper divisors (834020935593).
1390034892615 is an equidigital number, since it uses as much as digits as its factorization.
1390034892615 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 92668992849.
The product of its (nonzero) digits is 1399680, while the sum is 51.
The spelling of 1390034892615 in words is "one trillion, three hundred ninety billion, thirty-four million, eight hundred ninety-two thousand, six hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •