Base | Representation |
---|---|
bin | 100011010001111100101… |
… | …0000111011001111001101 |
3 | 122011112212112100120220111 |
4 | 1012203321100323033031 |
5 | 1113421024144323423 |
6 | 14151320051520021 |
7 | 1010215250035516 |
oct | 106437120731715 |
9 | 18145775316814 |
10 | 4848905073613 |
11 | 15aa455559a77 |
12 | 6639005b9011 |
13 | 292332a1c593 |
14 | 12a98c817a0d |
15 | 861e795e60d |
hex | 468f943b3cd |
4848905073613 has 4 divisors (see below), whose sum is σ = 4854227692608. Its totient is φ = 4843582454620.
The previous prime is 4848905073599. The next prime is 4848905073619. The reversal of 4848905073613 is 3163705098484.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 4848905073613 - 241 = 2649881818061 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4848905073619) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2661308131 + ... + 2661309952.
It is an arithmetic number, because the mean of its divisors is an integer number (1213556923152).
Almost surely, 24848905073613 is an apocalyptic number.
It is an amenable number.
4848905073613 is a deficient number, since it is larger than the sum of its proper divisors (5322618995).
4848905073613 is an equidigital number, since it uses as much as digits as its factorization.
4848905073613 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5322618994.
The product of its (nonzero) digits is 17418240, while the sum is 58.
The spelling of 4848905073613 in words is "four trillion, eight hundred forty-eight billion, nine hundred five million, seventy-three thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •