Base | Representation |
---|---|
bin | 100001111111110101001… |
… | …0100010110000111011100 |
3 | 121112200200210012211112020 |
4 | 1003333222110112013130 |
5 | 1103023401011342024 |
6 | 13534313354540140 |
7 | 661403260142544 |
oct | 103775224260734 |
9 | 17480623184466 |
10 | 4672560652764 |
11 | 1541692747594 |
12 | 6356a7137650 |
13 | 27b80b547b24 |
14 | 122220318324 |
15 | 81826145979 |
hex | 43fea5161dc |
4672560652764 has 12 divisors (see below), whose sum is σ = 10902641523144. Its totient is φ = 1557520217584.
The previous prime is 4672560652723. The next prime is 4672560652807.
4672560652764 is nontrivially palindromic in base 10.
It is a tau number, because it is divible by the number of its divisors (12).
It is a junction number, because it is equal to n+sod(n) for n = 4672560652698 and 4672560652707.
It is a congruent number.
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 3 ways as a sum of consecutive naturals, for example, 194690027187 + ... + 194690027210.
It is an arithmetic number, because the mean of its divisors is an integer number (908553460262).
Almost surely, 24672560652764 is an apocalyptic number.
It is an amenable number.
4672560652764 is an abundant number, since it is smaller than the sum of its proper divisors (6230080870380).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4672560652764 is a wasteful number, since it uses less digits than its factorization.
4672560652764 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 389380054404 (or 389380054402 counting only the distinct ones).
The product of its (nonzero) digits is 101606400, while the sum is 60.
The spelling of 4672560652764 in words is "four trillion, six hundred seventy-two billion, five hundred sixty million, six hundred fifty-two thousand, seven hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •