Base | Representation |
---|---|
bin | 111010111000001101… |
… | …011011000010010100 |
3 | 20001011220201020022112 |
4 | 322320031123002110 |
5 | 2013433314143000 |
6 | 45013133250152 |
7 | 4365436500341 |
oct | 727015330224 |
9 | 201156636275 |
10 | 63220068500 |
11 | 248a20981a6 |
12 | 10304333958 |
13 | 5c66904374 |
14 | 30ba3c37c8 |
15 | 19a02b7235 |
hex | eb835b094 |
63220068500 has 96 divisors (see below), whose sum is σ = 143804553984. Its totient is φ = 24257520000.
The previous prime is 63220068497. The next prime is 63220068521. The reversal of 63220068500 is 586002236.
It is a super-2 number, since 2×632200685002 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1289435 + ... + 1337565.
It is an arithmetic number, because the mean of its divisors is an integer number (1497964104).
Almost surely, 263220068500 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 63220068500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (71902276992).
63220068500 is an abundant number, since it is smaller than the sum of its proper divisors (80584485484).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
63220068500 is a wasteful number, since it uses less digits than its factorization.
63220068500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48258 (or 48246 counting only the distinct ones).
The product of its (nonzero) digits is 17280, while the sum is 32.
The spelling of 63220068500 in words is "sixty-three billion, two hundred twenty million, sixty-eight thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •