Base | Representation |
---|---|
bin | 1010101001001001100011… |
… | …0111100101010111101000 |
3 | 1112102201001101011111110221 |
4 | 2222102120313211113220 |
5 | 3013211302214401440 |
6 | 40515503344015424 |
7 | 2315305563413263 |
oct | 252223067452750 |
9 | 45381041144427 |
10 | 11702055622120 |
11 | 38018a5365966 |
12 | 138bb2a901574 |
13 | 66b664711736 |
14 | 2c654d893cda |
15 | 1545e5e5ed4a |
hex | aa498de55e8 |
11702055622120 has 32 divisors (see below), whose sum is σ = 26363864003400. Its totient is φ = 4674735341568.
The previous prime is 11702055622111. The next prime is 11702055622121. The reversal of 11702055622120 is 2122655020711.
11702055622120 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 11272980840676 + 429074781444 = 3357526^2 + 655038^2 .
It is not an unprimeable number, because it can be changed into a prime (11702055622121) 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, 190184709 + ... + 190246228.
Almost surely, 211702055622120 is an apocalyptic number.
11702055622120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11702055622120 is an abundant number, since it is smaller than the sum of its proper divisors (14661808381280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11702055622120 is a wasteful number, since it uses less digits than its factorization.
11702055622120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 380431717 (or 380431713 counting only the distinct ones).
The product of its (nonzero) digits is 16800, while the sum is 34.
The spelling of 11702055622120 in words is "eleven trillion, seven hundred two billion, fifty-five million, six hundred twenty-two thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •