Base | Representation |
---|---|
bin | 111010111010111101… |
… | …000110001100011000 |
3 | 20001022010100220202010 |
4 | 322322331012030120 |
5 | 2014032111323342 |
6 | 45021500305520 |
7 | 4366536102552 |
oct | 727275061430 |
9 | 201263326663 |
10 | 63266120472 |
11 | 24916091785 |
12 | 103178422a0 |
13 | 5c73309759 |
14 | 30c25704d2 |
15 | 19a436229c |
hex | ebaf46318 |
63266120472 has 64 divisors (see below), whose sum is σ = 160598592000. Its totient is φ = 20765706624.
The previous prime is 63266120471. The next prime is 63266120473. The reversal of 63266120472 is 27402166236.
It is an interprime number because it is at equal distance from previous prime (63266120471) and next prime (63266120473).
It is a self number, because there is not a number n which added to its sum of digits gives 63266120472.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (63266120471) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 662479 + ... + 751937.
It is an arithmetic number, because the mean of its divisors is an integer number (2509353000).
Almost surely, 263266120472 is an apocalyptic number.
It is an amenable number.
63266120472 is an abundant number, since it is smaller than the sum of its proper divisors (97332471528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
63266120472 is a wasteful number, since it uses less digits than its factorization.
63266120472 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 89920 (or 89916 counting only the distinct ones).
The product of its (nonzero) digits is 145152, while the sum is 39.
The spelling of 63266120472 in words is "sixty-three billion, two hundred sixty-six million, one hundred twenty thousand, four hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •