Base | Representation |
---|---|
bin | 10011001101101110… |
… | …101101111000001000 |
3 | 1222020211200222221121 |
4 | 103031232231320020 |
5 | 314223122220000 |
6 | 13251123245024 |
7 | 1330160250265 |
oct | 231556557010 |
9 | 58224628847 |
10 | 20631445000 |
11 | 8827a04aa1 |
12 | 3bb9519774 |
13 | 1c3a46312a |
14 | dda0d626c |
15 | 80b3eab1a |
hex | 4cdbade08 |
20631445000 has 40 divisors (see below), whose sum is σ = 48339487350. Its totient is φ = 8252576000.
The previous prime is 20631444983. The next prime is 20631445019. The reversal of 20631445000 is 54413602.
It can be written as a sum of positive squares in 5 ways, for example, as 45508516 + 20585936484 = 6746^2 + 143478^2 .
It is a tau number, because it is divible by the number of its divisors (40).
It is a super-3 number, since 3×206314450003 (a number of 32 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is an unprimeable number.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 2058145 + ... + 2068144.
Almost surely, 220631445000 is an apocalyptic number.
20631445000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20631445000 is an abundant number, since it is smaller than the sum of its proper divisors (27708042350).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20631445000 is an equidigital number, since it uses as much as digits as its factorization.
20631445000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4126315 (or 4126296 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 25.
Adding to 20631445000 its reverse (54413602), we get a palindrome (20685858602).
The spelling of 20631445000 in words is "twenty billion, six hundred thirty-one million, four hundred forty-five thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •