Base | Representation |
---|---|
bin | 101101100110000011010… |
… | …1010001000111101000100 |
3 | 211012001211222222000211222 |
4 | 1123030012222020331010 |
5 | 1310132212030314014 |
6 | 21154435350215512 |
7 | 1214510641412240 |
oct | 133140652107504 |
9 | 24161758860758 |
10 | 6266468994884 |
11 | 1aa665a42127a |
12 | 852597954598 |
13 | 365c053c2677 |
14 | 179427977420 |
15 | ad012a3908e |
hex | 5b306a88f44 |
6266468994884 has 12 divisors (see below), whose sum is σ = 12532937989824. Its totient is φ = 2685629569224.
The previous prime is 6266468994883. The next prime is 6266468994887. The reversal of 6266468994884 is 4884998646626.
6266468994884 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 6266468994799 and 6266468994808.
It is not an unprimeable number, because it can be changed into a prime (6266468994883) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 111901232024 + ... + 111901232079.
It is an arithmetic number, because the mean of its divisors is an integer number (1044411499152).
Almost surely, 26266468994884 is an apocalyptic number.
It is an amenable number.
6266468994884 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6266468994884 is a wasteful number, since it uses less digits than its factorization.
6266468994884 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 223802464114 (or 223802464112 counting only the distinct ones).
The product of its digits is 6879707136, while the sum is 80.
The spelling of 6266468994884 in words is "six trillion, two hundred sixty-six billion, four hundred sixty-eight million, nine hundred ninety-four thousand, eight hundred eighty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •