Base | Representation |
---|---|
bin | 11011001111010100… |
… | …00010011010000111 |
3 | 1101202011120220102110 |
4 | 31213222002122013 |
5 | 214422214200142 |
6 | 10415042312103 |
7 | 1025252510523 |
oct | 154752023207 |
9 | 41664526373 |
10 | 14623975047 |
11 | 62249419a0 |
12 | 2a01658633 |
13 | 14c0980296 |
14 | 9ca300d83 |
15 | 5a8cd999c |
hex | 367a82687 |
14623975047 has 8 divisors (see below), whose sum is σ = 21271236480. Its totient is φ = 8863015160.
The previous prime is 14623975033. The next prime is 14623975057. The reversal of 14623975047 is 74057932641.
14623975047 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 14623975047 - 26 = 14623974983 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 14623974987 and 14623975005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14623975057) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 221575347 + ... + 221575412.
It is an arithmetic number, because the mean of its divisors is an integer number (2658904560).
Almost surely, 214623975047 is an apocalyptic number.
14623975047 is a deficient number, since it is larger than the sum of its proper divisors (6647261433).
14623975047 is a wasteful number, since it uses less digits than its factorization.
14623975047 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 443150773.
The product of its (nonzero) digits is 1270080, while the sum is 48.
The spelling of 14623975047 in words is "fourteen billion, six hundred twenty-three million, nine hundred seventy-five thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •