Base | Representation |
---|---|
bin | 11011010101001101… |
… | …11101101101110010 |
3 | 1101212121210002022120 |
4 | 31222212331231302 |
5 | 220022404013132 |
6 | 10424012015110 |
7 | 1026423462264 |
oct | 155246755562 |
9 | 41777702276 |
10 | 14673501042 |
11 | 624a899572 |
12 | 2a16161496 |
13 | 14cb0009c5 |
14 | 9d2b13b34 |
15 | 5ad31e02c |
hex | 36a9bdb72 |
14673501042 has 8 divisors (see below), whose sum is σ = 29347002096. Its totient is φ = 4891167012.
The previous prime is 14673500981. The next prime is 14673501043. The reversal of 14673501042 is 24010537641.
It is a sphenic number, since it is the product of 3 distinct primes.
14673501042 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 14673500994 and 14673501012.
It is not an unprimeable number, because it can be changed into a prime (14673501043) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1222791748 + ... + 1222791759.
It is an arithmetic number, because the mean of its divisors is an integer number (3668375262).
Almost surely, 214673501042 is an apocalyptic number.
14673501042 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14673501042 is a wasteful number, since it uses less digits than its factorization.
14673501042 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2445583512.
The product of its (nonzero) digits is 20160, while the sum is 33.
The spelling of 14673501042 in words is "fourteen billion, six hundred seventy-three million, five hundred one thousand, forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •