Base | Representation |
---|---|
bin | 10011010011110000101000… |
… | …001101111101001010000001 |
3 | 102010200100100100012210102111 |
4 | 103103300220031331022001 |
5 | 42112320213114423041 |
6 | 500340021243015321 |
7 | 23613215541052201 |
oct | 2323605015751201 |
9 | 363610310183374 |
10 | 84920768123521 |
11 | 250707717a9150 |
12 | 963626950a541 |
13 | 384ccbcc93425 |
14 | 16d82895d0401 |
15 | 9c3eb6318981 |
hex | 4d3c2837d281 |
84920768123521 has 8 divisors (see below), whose sum is σ = 93254353437888. Its totient is φ = 76689435390000.
The previous prime is 84920768123501. The next prime is 84920768123531. The reversal of 84920768123521 is 12532186702948.
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 84920768123521 - 213 = 84920768115329 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (84920768123501) 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, 25563143470 + ... + 25563146791.
It is an arithmetic number, because the mean of its divisors is an integer number (11656794179736).
It is a 2-persistent number, because it is pandigital, and so is 2⋅84920768123521 = 169841536247042, but 3⋅84920768123521 = 254762304370563 is not.
Almost surely, 284920768123521 is an apocalyptic number.
It is an amenable number.
84920768123521 is a deficient number, since it is larger than the sum of its proper divisors (8333585314367).
84920768123521 is a wasteful number, since it uses less digits than its factorization.
84920768123521 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51126290423.
The product of its (nonzero) digits is 11612160, while the sum is 58.
The spelling of 84920768123521 in words is "eighty-four trillion, nine hundred twenty billion, seven hundred sixty-eight million, one hundred twenty-three thousand, five hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •