Base | Representation |
---|---|
bin | 1001110110010010100111010… |
… | …1111101111010101111011001 |
3 | 10100212202022110001012121020101 |
4 | 2131210221311331322233121 |
5 | 1211313302321323310231 |
6 | 10453525213425455401 |
7 | 265654321451505232 |
oct | 23544516575725731 |
9 | 3325668401177211 |
10 | 693012132244441 |
11 | 1908a6881954679 |
12 | 65886488aa1561 |
13 | 2398c9c09b1cc9 |
14 | c31bd7524c089 |
15 | 551bc81432661 |
hex | 2764a75f7abd9 |
693012132244441 has 16 divisors (see below), whose sum is σ = 711193692470976. Its totient is φ = 674924738374656.
The previous prime is 693012132244429. The next prime is 693012132244459. The reversal of 693012132244441 is 144442231210396.
It is a cyclic number.
It is not a de Polignac number, because 693012132244441 - 215 = 693012132211673 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 693012132244391 and 693012132244400.
It is not an unprimeable number, because it can be changed into a prime (693012132248441) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 191174986 + ... + 194766268.
It is an arithmetic number, because the mean of its divisors is an integer number (44449605779436).
Almost surely, 2693012132244441 is an apocalyptic number.
It is an amenable number.
693012132244441 is a deficient number, since it is larger than the sum of its proper divisors (18181560226535).
693012132244441 is a wasteful number, since it uses less digits than its factorization.
693012132244441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3604392.
The product of its (nonzero) digits is 995328, while the sum is 46.
The spelling of 693012132244441 in words is "six hundred ninety-three trillion, twelve billion, one hundred thirty-two million, two hundred forty-four thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •