Base | Representation |
---|---|
bin | 10101111110101111000011… |
… | …10001010010101001011001 |
3 | 20100010210020001222121200001 |
4 | 22333113201301102221121 |
5 | 22313410143010330141 |
6 | 250444452335013001 |
7 | 13116043500503263 |
oct | 1277274161225131 |
9 | 210123201877601 |
10 | 48335054776921 |
11 | 14445866369320 |
12 | 55077a806a161 |
13 | 20c7c8c67c973 |
14 | bd1601784b33 |
15 | 58c48bae1a31 |
hex | 2bf5e1c52a59 |
48335054776921 has 8 divisors (see below), whose sum is σ = 52752267374688. Its totient is φ = 43921694964000.
The previous prime is 48335054776919. The next prime is 48335054776937. The reversal of 48335054776921 is 12967745053384.
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 48335054776921 - 21 = 48335054776919 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (48335054771921) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 963169975 + ... + 963220156.
It is an arithmetic number, because the mean of its divisors is an integer number (6594033421836).
It is a 2-persistent number, because it is pandigital, and so is 2⋅48335054776921 = 96670109553842, but 3⋅48335054776921 = 145005164330763 is not.
Almost surely, 248335054776921 is an apocalyptic number.
It is an amenable number.
48335054776921 is a deficient number, since it is larger than the sum of its proper divisors (4417212597767).
48335054776921 is a wasteful number, since it uses less digits than its factorization.
48335054776921 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1926392423.
The product of its (nonzero) digits is 152409600, while the sum is 64.
The spelling of 48335054776921 in words is "forty-eight trillion, three hundred thirty-five billion, fifty-four million, seven hundred seventy-six thousand, nine hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •