Base | Representation |
---|---|
bin | 10100010111100011001… |
… | …001010101000001110110 |
3 | 11221210210202220111220101 |
4 | 110113203021111001312 |
5 | 140413013330312122 |
6 | 2551000230024314 |
7 | 203060154164332 |
oct | 24274311250166 |
9 | 4853722814811 |
10 | 1399675244662 |
11 | 49a665205852 |
12 | 1a73244a809a |
13 | a1cb154c356 |
14 | 4ba5d4307c2 |
15 | 2661e8b1027 |
hex | 145e3255076 |
1399675244662 has 4 divisors (see below), whose sum is σ = 2099512866996. Its totient is φ = 699837622330.
The previous prime is 1399675244599. The next prime is 1399675244731. The reversal of 1399675244662 is 2664425769931.
It is a semiprime because it is the product of two primes.
It is a junction number, because it is equal to n+sod(n) for n = 1399675244594 and 1399675244603.
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 as a sum of consecutive naturals, namely, 349918811164 + ... + 349918811167.
It is an arithmetic number, because the mean of its divisors is an integer number (524878216749).
Almost surely, 21399675244662 is an apocalyptic number.
1399675244662 is a deficient number, since it is larger than the sum of its proper divisors (699837622334).
1399675244662 is an equidigital number, since it uses as much as digits as its factorization.
1399675244662 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 699837622333.
The product of its digits is 117573120, while the sum is 64.
The spelling of 1399675244662 in words is "one trillion, three hundred ninety-nine billion, six hundred seventy-five million, two hundred forty-four thousand, six hundred sixty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •