Base | Representation |
---|---|
bin | 1001001001000001101010… |
… | …11111101001001111100000 |
3 | 2122011200002020220010102201 |
4 | 10210200311133221033200 |
5 | 10113320023133324440 |
6 | 110430232525022544 |
7 | 4143163024341316 |
oct | 444406537511740 |
9 | 78150066803381 |
10 | 20101344433120 |
11 | 644aa28989695 |
12 | 23079376b4a54 |
13 | b2a7194b7a22 |
14 | 4d6ca5a880b6 |
15 | 24cd3713b19a |
hex | 1248357e93e0 |
20101344433120 has 48 divisors (see below), whose sum is σ = 49988869716240. Its totient is φ = 7617351573504.
The previous prime is 20101344433111. The next prime is 20101344433127. The reversal of 20101344433120 is 2133444310102.
It is a happy number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20101344433127) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3306139137 + ... + 3306145216.
It is an arithmetic number, because the mean of its divisors is an integer number (1041434785755).
Almost surely, 220101344433120 is an apocalyptic number.
20101344433120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20101344433120 is an abundant number, since it is smaller than the sum of its proper divisors (29887525283120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20101344433120 is a wasteful number, since it uses less digits than its factorization.
20101344433120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6612284387 (or 6612284379 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 28.
Adding to 20101344433120 its reverse (2133444310102), we get a palindrome (22234788743222).
The spelling of 20101344433120 in words is "twenty trillion, one hundred one billion, three hundred forty-four million, four hundred thirty-three thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •