Base | Representation |
---|---|
bin | 10110000010001001011011… |
… | …01110100110001000000110 |
3 | 20100112222211121212102012020 |
4 | 23001010231232212020012 |
5 | 22322320244033140221 |
6 | 251014402022304010 |
7 | 13130363665231335 |
oct | 1301045556461006 |
9 | 210488747772166 |
10 | 48452293255686 |
11 | 14490558437691 |
12 | 5526466b88006 |
13 | 21060546c00a8 |
14 | bd7164041d1c |
15 | 59054e40dac6 |
hex | 2c112dba6206 |
48452293255686 has 8 divisors (see below), whose sum is σ = 96904586511384. Its totient is φ = 16150764418560.
The previous prime is 48452293255649. The next prime is 48452293255733. The reversal of 48452293255686 is 68655239225484.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
48452293255686 is an admirable number.
It is a self number, because there is not a number n which added to its sum of digits gives 48452293255686.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 4037691104635 + ... + 4037691104646.
It is an arithmetic number, because the mean of its divisors is an integer number (12113073313923).
Almost surely, 248452293255686 is an apocalyptic number.
48452293255686 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.
48452293255686 is a wasteful number, since it uses less digits than its factorization.
48452293255686 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8075382209286.
The product of its digits is 995328000, while the sum is 69.
The spelling of 48452293255686 in words is "forty-eight trillion, four hundred fifty-two billion, two hundred ninety-three million, two hundred fifty-five thousand, six hundred eighty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •