Base | Representation |
---|---|
bin | 11011001110011111… |
… | …10100110101000001 |
3 | 1101201200122210200102 |
4 | 31213033310311001 |
5 | 214413434304211 |
6 | 10414235132145 |
7 | 1025140221425 |
oct | 154717646501 |
9 | 41650583612 |
10 | 14617103681 |
11 | 6220a79384 |
12 | 29bb2a4055 |
13 | 14bc41579b |
14 | 9c9432b85 |
15 | 5a83cda3b |
hex | 3673f4d41 |
14617103681 has 16 divisors (see below), whose sum is σ = 15472256256. Its totient is φ = 13780521216.
The previous prime is 14617103671. The next prime is 14617103687. The reversal of 14617103681 is 18630171641.
It is a cyclic number.
It is not a de Polignac number, because 14617103681 - 230 = 13543361857 is a prime.
It is a super-2 number, since 2×146171036812 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (14617103687) 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 15 ways as a sum of consecutive naturals, for example, 4066421 + ... + 4070013.
It is an arithmetic number, because the mean of its divisors is an integer number (967016016).
Almost surely, 214617103681 is an apocalyptic number.
It is an amenable number.
14617103681 is a deficient number, since it is larger than the sum of its proper divisors (855152575).
14617103681 is a wasteful number, since it uses less digits than its factorization.
14617103681 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6112.
The product of its (nonzero) digits is 24192, while the sum is 38.
The spelling of 14617103681 in words is "fourteen billion, six hundred seventeen million, one hundred three thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •