Base | Representation |
---|---|
bin | 10101111001011111010010… |
… | …10110000101011010110001 |
3 | 20022111112221100002112220222 |
4 | 22330233221112011122301 |
5 | 22302432004032024040 |
6 | 250230001232342425 |
7 | 13100032444623521 |
oct | 1274575126053261 |
9 | 208445840075828 |
10 | 48154793236145 |
11 | 14386373430742 |
12 | 549887a9a4a15 |
13 | 20b3c927b4a7b |
14 | bc69c0d47681 |
15 | 58793b474bb5 |
hex | 2bcbe95856b1 |
48154793236145 has 8 divisors (see below), whose sum is σ = 58577337526056. Its totient is φ = 37996110827136.
The previous prime is 48154793236073. The next prime is 48154793236159. The reversal of 48154793236145 is 54163239745184.
It can be written as a sum of positive squares in 4 ways, for example, as 148505412496 + 48006287823649 = 385364^2 + 6928657^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-48154793236145 is a prime.
It is a super-2 number, since 2×481547932361452 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 65965469822 + ... + 65965470551.
It is an arithmetic number, because the mean of its divisors is an integer number (7322167190757).
Almost surely, 248154793236145 is an apocalyptic number.
It is an amenable number.
48154793236145 is a deficient number, since it is larger than the sum of its proper divisors (10422544289911).
48154793236145 is a wasteful number, since it uses less digits than its factorization.
48154793236145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 131930940451.
The product of its digits is 87091200, while the sum is 62.
The spelling of 48154793236145 in words is "forty-eight trillion, one hundred fifty-four billion, seven hundred ninety-three million, two hundred thirty-six thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •