Base | Representation |
---|---|
bin | 100111001100101000110… |
… | …101100101000000111001 |
3 | 100112111201200100211210211 |
4 | 213030220311211000321 |
5 | 323113023141102343 |
6 | 5421234131111121 |
7 | 365415440031610 |
oct | 47145065450071 |
9 | 10474650324724 |
10 | 2693629628473 |
11 | 9493a8780023 |
12 | 3760631424a1 |
13 | 167014c98ab4 |
14 | 9452dad4877 |
15 | 4a102b8c79d |
hex | 27328d65039 |
2693629628473 has 8 divisors (see below), whose sum is σ = 3078549402048. Its totient is φ = 2308738740144.
The previous prime is 2693629628467. The next prime is 2693629628489. The reversal of 2693629628473 is 3748269263962.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2693629628473 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2693629628399 and 2693629628408.
It is not an unprimeable number, because it can be changed into a prime (2693629628413) by changing a digit.
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, 7021111 + ... + 7394812.
It is an arithmetic number, because the mean of its divisors is an integer number (384818675256).
Almost surely, 22693629628473 is an apocalyptic number.
It is an amenable number.
2693629628473 is a deficient number, since it is larger than the sum of its proper divisors (384919773575).
2693629628473 is a wasteful number, since it uses less digits than its factorization.
2693629628473 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14442623.
The product of its digits is 282175488, while the sum is 67.
The spelling of 2693629628473 in words is "two trillion, six hundred ninety-three billion, six hundred twenty-nine million, six hundred twenty-eight thousand, four hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •