Base | Representation |
---|---|
bin | 11111001101100011110000… |
… | …01101111011001101101011 |
3 | 100000000111110120121002101121 |
4 | 33212301320031323031223 |
5 | 32444011144120301121 |
6 | 401550431242200111 |
7 | 20312521003423036 |
oct | 1746617015731553 |
9 | 300014416532347 |
10 | 68635594306411 |
11 | 1a9622127290a0 |
12 | 78460557b3037 |
13 | 2c3b4024a7a02 |
14 | 12d3da266a01d |
15 | 7e05816ac141 |
hex | 3e6c7837b36b |
68635594306411 has 8 divisors (see below), whose sum is σ = 76616477365824. Its totient is φ = 60944925176520.
The previous prime is 68635594306397. The next prime is 68635594306457. The reversal of 68635594306411 is 11460349553686.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-68635594306411 is a prime.
It is a super-3 number, since 3×686355943064113 (a number of 42 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 68635594306411.
It is not an unprimeable number, because it can be changed into a prime (68635594306711) 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, 72553481881 + ... + 72553482826.
It is an arithmetic number, because the mean of its divisors is an integer number (9577059670728).
Almost surely, 268635594306411 is an apocalyptic number.
68635594306411 is a deficient number, since it is larger than the sum of its proper divisors (7980883059413).
68635594306411 is a wasteful number, since it uses less digits than its factorization.
68635594306411 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 145106964761.
The product of its (nonzero) digits is 55987200, while the sum is 61.
The spelling of 68635594306411 in words is "sixty-eight trillion, six hundred thirty-five billion, five hundred ninety-four million, three hundred six thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •