Base | Representation |
---|---|
bin | 10110111111100000010010… |
… | …011111010010111110100110 |
3 | 111021001002000202121122210212 |
4 | 112333200102133102332212 |
5 | 101223231322133223420 |
6 | 555022204432215422 |
7 | 30204516101543144 |
oct | 2677402237227646 |
9 | 437032022548725 |
10 | 101121020211110 |
11 | 2a247202764969 |
12 | b411b2109a572 |
13 | 4456895a91553 |
14 | 1ad83d7c90594 |
15 | ba55ca8613c5 |
hex | 5bf8127d2fa6 |
101121020211110 has 16 divisors (see below), whose sum is σ = 182026512122832. Its totient is φ = 40446480141600.
The previous prime is 101121020211109. The next prime is 101121020211137. The reversal of 101121020211110 is 11112020121101.
101121020211110 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 240772556 + ... + 241192175.
It is an arithmetic number, because the mean of its divisors is an integer number (11376657007677).
Almost surely, 2101121020211110 is an apocalyptic number.
101121020211110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
101121020211110 is a deficient number, since it is larger than the sum of its proper divisors (80905491911722).
101121020211110 is a wasteful number, since it uses less digits than its factorization.
101121020211110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 481985719.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 101121020211110 its reverse (11112020121101), we get a palindrome (112233040332211).
Subtracting from 101121020211110 its reverse (11112020121101), we obtain a palindrome (90009000090009).
The spelling of 101121020211110 in words is "one hundred one trillion, one hundred twenty-one billion, twenty million, two hundred eleven thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •