Base | Representation |
---|---|
bin | 100010101011101001111… |
… | …0010010011001011000100 |
3 | 121212200121120011000202020 |
4 | 1011113103302103023010 |
5 | 1111044121002101242 |
6 | 14045440121443140 |
7 | 1001244400500546 |
oct | 105272362231304 |
9 | 17780546130666 |
10 | 4766671909572 |
11 | 1578597031781 |
12 | 64b9909404b0 |
13 | 287659043c31 |
14 | 1269cb24b696 |
15 | 83ed33c26ec |
hex | 455d3c932c4 |
4766671909572 has 48 divisors (see below), whose sum is σ = 11796069086592. Its totient is φ = 1494893537280.
The previous prime is 4766671909543. The next prime is 4766671909577. The reversal of 4766671909572 is 2759091766674.
It is a super-2 number, since 2×47666719095722 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (69).
It is a junction number, because it is equal to n+sod(n) for n = 4766671909497 and 4766671909506.
It is not an unprimeable number, because it can be changed into a prime (4766671909577) 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, 141545053 + ... + 141578724.
It is an arithmetic number, because the mean of its divisors is an integer number (245751439304).
Almost surely, 24766671909572 is an apocalyptic number.
It is an amenable number.
4766671909572 is an abundant number, since it is smaller than the sum of its proper divisors (7029397177020).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4766671909572 is a wasteful number, since it uses less digits than its factorization.
4766671909572 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 283123868 (or 283123866 counting only the distinct ones).
The product of its (nonzero) digits is 240045120, while the sum is 69.
The spelling of 4766671909572 in words is "four trillion, seven hundred sixty-six billion, six hundred seventy-one million, nine hundred nine thousand, five hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •