Base | Representation |
---|---|
bin | 10010110001010101… |
… | …010011010110011000 |
3 | 1221000122020010200000 |
4 | 102301111103112120 |
5 | 312234141130241 |
6 | 13131544013000 |
7 | 1312313564166 |
oct | 226125232630 |
9 | 57018203600 |
10 | 20155020696 |
11 | 8602a903a8 |
12 | 3aa5a61160 |
13 | 1b92843b65 |
14 | d92b1a236 |
15 | 7ce68ceb6 |
hex | 4b1553598 |
20155020696 has 96 divisors (see below), whose sum is σ = 56969661840. Its totient is φ = 6675447168.
The previous prime is 20155020661. The next prime is 20155020707. The reversal of 20155020696 is 69602055102.
20155020696 is a `hidden beast` number, since 20 + 1 + 550 + 20 + 69 + 6 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a self number, because there is not a number n which added to its sum of digits gives 20155020696.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 272190 + ... + 338226.
Almost surely, 220155020696 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 20155020696, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (28484830920).
20155020696 is an abundant number, since it is smaller than the sum of its proper divisors (36814641144).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20155020696 is a wasteful number, since it uses less digits than its factorization.
20155020696 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 66215 (or 66199 counting only the distinct ones).
The product of its (nonzero) digits is 32400, while the sum is 36.
Adding to 20155020696 its reverse (69602055102), we get a palindrome (89757075798).
The spelling of 20155020696 in words is "twenty billion, one hundred fifty-five million, twenty thousand, six hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •