Base | Representation |
---|---|
bin | 101100110100011111001… |
… | …1111001000000010100000 |
3 | 210210220010011221111011010 |
4 | 1121220332133020002200 |
5 | 1301411221022333443 |
6 | 21033513540220520 |
7 | 1204022215250145 |
oct | 131507637100240 |
9 | 23726104844133 |
10 | 6160031449248 |
11 | 1a65500185926 |
12 | 835a3209a740 |
13 | 358b71c8b231 |
14 | 17420b96c3cc |
15 | aa383588733 |
hex | 59a3e7c80a0 |
6160031449248 has 48 divisors (see below), whose sum is σ = 16185920306976. Its totient is φ = 2051332673280.
The previous prime is 6160031449223. The next prime is 6160031449277. The reversal of 6160031449248 is 8429441300616.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (48).
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a junction number, because it is equal to n+sod(n) for n = 6160031449197 and 6160031449206.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 31325586 + ... + 31521617.
It is an arithmetic number, because the mean of its divisors is an integer number (337206673062).
Almost surely, 26160031449248 is an apocalyptic number.
It is an amenable number.
6160031449248 is an abundant number, since it is smaller than the sum of its proper divisors (10025888857728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6160031449248 is a wasteful number, since it uses less digits than its factorization.
6160031449248 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62848237 (or 62848229 counting only the distinct ones).
The product of its (nonzero) digits is 995328, while the sum is 48.
The spelling of 6160031449248 in words is "six trillion, one hundred sixty billion, thirty-one million, four hundred forty-nine thousand, two hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •