Base | Representation |
---|---|
bin | 10101111010101110000111… |
… | …01001110100001111000101 |
3 | 20022122121011111120200212010 |
4 | 22331113003221310033011 |
5 | 22304130140300004042 |
6 | 250301240311244433 |
7 | 13103061221056020 |
oct | 1275270351641705 |
9 | 208577144520763 |
10 | 48197110547397 |
11 | 143a2309453a49 |
12 | 54a4b0a979719 |
13 | 20b7c77990b06 |
14 | bc8a771ac1b7 |
15 | 588ab65ec59c |
hex | 2bd5c3a743c5 |
48197110547397 has 32 divisors (see below), whose sum is σ = 76644370649088. Its totient is φ = 26341022163456.
The previous prime is 48197110547387. The next prime is 48197110547429. The reversal of 48197110547397 is 79374501179184.
It is not a de Polignac number, because 48197110547397 - 210 = 48197110546373 is a prime.
It is a super-2 number, since 2×481971105473972 (a number of 28 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (66) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (48197110547387) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 536908 + ... + 9832725.
It is an arithmetic number, because the mean of its divisors is an integer number (2395136582784).
Almost surely, 248197110547397 is an apocalyptic number.
It is an amenable number.
48197110547397 is a deficient number, since it is larger than the sum of its proper divisors (28447260101691).
48197110547397 is a wasteful number, since it uses less digits than its factorization.
48197110547397 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10379289.
The product of its (nonzero) digits is 53343360, while the sum is 66.
The spelling of 48197110547397 in words is "forty-eight trillion, one hundred ninety-seven billion, one hundred ten million, five hundred forty-seven thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •