Base | Representation |
---|---|
bin | 100111110010100100000… |
… | …1011100000100000000100 |
3 | 201100210200102000210110212 |
4 | 1033211020023200200010 |
5 | 1204044401303002233 |
6 | 15344142121134552 |
7 | 1103046406644230 |
oct | 117451013404004 |
9 | 21323612023425 |
10 | 5468704344068 |
11 | 18192a00404a9 |
12 | 743a5602a458 |
13 | 3089095a3324 |
14 | 14c9884515c0 |
15 | 973c0ae7a48 |
hex | 4f9482e0804 |
5468704344068 has 12 divisors (see below), whose sum is σ = 10937408688192. Its totient is φ = 2343730433160.
The previous prime is 5468704344067. The next prime is 5468704344097. The reversal of 5468704344068 is 8604434078645.
5468704344068 is an admirable number.
It is a hoax number, since the sum of its digits (59) coincides with the sum of the digits of its distinct prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 5468704343998 and 5468704344016.
It is not an unprimeable number, because it can be changed into a prime (5468704344067) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 97655434688 + ... + 97655434743.
It is an arithmetic number, because the mean of its divisors is an integer number (911450724016).
Almost surely, 25468704344068 is an apocalyptic number.
It is an amenable number.
5468704344068 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.
5468704344068 is a wasteful number, since it uses less digits than its factorization.
5468704344068 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 195310869442 (or 195310869440 counting only the distinct ones).
The product of its (nonzero) digits is 61931520, while the sum is 59.
The spelling of 5468704344068 in words is "five trillion, four hundred sixty-eight billion, seven hundred four million, three hundred forty-four thousand, sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •