Base | Representation |
---|---|
bin | 11011010100001000… |
… | …10110010011010001 |
3 | 1101211222201001200000 |
4 | 31222010112103101 |
5 | 220013043123310 |
6 | 10423045320213 |
7 | 1026253366425 |
oct | 155204262321 |
9 | 41758631600 |
10 | 14664426705 |
11 | 6245760915 |
12 | 2a13106069 |
13 | 14c9174586 |
14 | 9d1830b85 |
15 | 5ac62a4c0 |
hex | 36a1164d1 |
14664426705 has 24 divisors (see below), whose sum is σ = 26359761792. Its totient is φ = 7821026928.
The previous prime is 14664426701. The next prime is 14664426731. The reversal of 14664426705 is 50762446641.
14664426705 is a `hidden beast` number, since 146 + 6 + 442 + 67 + 0 + 5 = 666.
It is not a de Polignac number, because 14664426705 - 22 = 14664426701 is a prime.
It is a hoax number, since the sum of its digits (45) coincides with the sum of the digits of its distinct prime factors.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is not an unprimeable number, because it can be changed into a prime (14664426701) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 6033529 + ... + 6035958.
It is an arithmetic number, because the mean of its divisors is an integer number (1098323408).
Almost surely, 214664426705 is an apocalyptic number.
14664426705 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
14664426705 is a deficient number, since it is larger than the sum of its proper divisors (11695335087).
14664426705 is an equidigital number, since it uses as much as digits as its factorization.
14664426705 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12069507 (or 12069495 counting only the distinct ones).
The product of its (nonzero) digits is 967680, while the sum is 45.
The spelling of 14664426705 in words is "fourteen billion, six hundred sixty-four million, four hundred twenty-six thousand, seven hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •