Base | Representation |
---|---|
bin | 1001100011011110001110011… |
… | …0010000111001001001111100 |
3 | 10021011111020122222021102222022 |
4 | 2120313203212100321021330 |
5 | 1201110301112120202443 |
6 | 10341523535130335312 |
7 | 261420402521102312 |
oct | 23067434620711174 |
9 | 3234436588242868 |
10 | 672320863834748 |
11 | 18524974a2a1a87 |
12 | 634a4354b8a538 |
13 | 22b1b77c22462b |
14 | bc047095d20b2 |
15 | 52ad91dd51e68 |
hex | 26378e643927c |
672320863834748 has 48 divisors (see below), whose sum is σ = 1210657063603680. Its totient is φ = 326494485196800.
The previous prime is 672320863834747. The next prime is 672320863834783. The reversal of 672320863834748 is 847438368023276.
672320863834748 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×6723208638347482 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (672320863834747) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 42416588 + ... + 56069676.
It is an arithmetic number, because the mean of its divisors is an integer number (25222022158410).
Almost surely, 2672320863834748 is an apocalyptic number.
It is an amenable number.
672320863834748 is a deficient number, since it is larger than the sum of its proper divisors (538336199768932).
672320863834748 is a wasteful number, since it uses less digits than its factorization.
672320863834748 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13654478 (or 13654476 counting only the distinct ones).
The product of its (nonzero) digits is 1560674304, while the sum is 71.
The spelling of 672320863834748 in words is "six hundred seventy-two trillion, three hundred twenty billion, eight hundred sixty-three million, eight hundred thirty-four thousand, seven hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •