Base | Representation |
---|---|
bin | 101000110011000110111… |
… | …1010110000111101101100 |
3 | 201212001110022021000012201 |
4 | 1101212031322300331230 |
5 | 1213332234202014034 |
6 | 15531544132311244 |
7 | 1116054310516240 |
oct | 121461572607554 |
9 | 21761408230181 |
10 | 5607313313644 |
11 | 1872059201919 |
12 | 766899a72524 |
13 | 3189c8c073a3 |
14 | 155577024420 |
15 | 9acd4647014 |
hex | 5198deb0f6c |
5607313313644 has 48 divisors (see below), whose sum is σ = 11739135034368. Its totient is φ = 2291398832448.
The previous prime is 5607313313611. The next prime is 5607313313663. The reversal of 5607313313644 is 4463133137065.
It is a Harshad number since it is a multiple of its sum of digits (46).
It is a junction number, because it is equal to n+sod(n) for n = 5607313313594 and 5607313313603.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 13529304 + ... + 13937599.
It is an arithmetic number, because the mean of its divisors is an integer number (244565313216).
Almost surely, 25607313313644 is an apocalyptic number.
It is an amenable number.
5607313313644 is an abundant number, since it is smaller than the sum of its proper divisors (6131821720724).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5607313313644 is a wasteful number, since it uses less digits than its factorization.
5607313313644 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27467254 (or 27467252 counting only the distinct ones).
The product of its (nonzero) digits is 1632960, while the sum is 46.
The spelling of 5607313313644 in words is "five trillion, six hundred seven billion, three hundred thirteen million, three hundred thirteen thousand, six hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •