Base | Representation |
---|---|
bin | 1001001101001000011100… |
… | …1011111011110011111111 |
3 | 1022211120121121010010220212 |
4 | 2103102013023323303333 |
5 | 2311311220004031421 |
6 | 33305341541303035 |
7 | 2063143021020146 |
oct | 223220713736377 |
9 | 38746547103825 |
10 | 10121211002111 |
11 | 3252421829a30 |
12 | 1175685104a7b |
13 | 5855701b9a91 |
14 | 26dc2522a75d |
15 | 1284213a8e5b |
hex | 934872fbcff |
10121211002111 has 8 divisors (see below), whose sum is σ = 11041779965904. Its totient is φ = 9200718517120.
The previous prime is 10121211002101. The next prime is 10121211002113. The reversal of 10121211002111 is 11120011212101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10121211002111 - 242 = 5723164491007 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10121211002113) 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, 18842810 + ... + 19372503.
It is an arithmetic number, because the mean of its divisors is an integer number (1380222495738).
Almost surely, 210121211002111 is an apocalyptic number.
10121211002111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10121211002111 is a deficient number, since it is larger than the sum of its proper divisors (920568963793).
10121211002111 is a wasteful number, since it uses less digits than its factorization.
10121211002111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38239401.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 10121211002111 its reverse (11120011212101), we get a palindrome (21241222214212).
The spelling of 10121211002111 in words is "ten trillion, one hundred twenty-one billion, two hundred eleven million, two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •