Base | Representation |
---|---|
bin | 10110111111100000010010… |
… | …011110100100110011111100 |
3 | 111021001002000202021001102020 |
4 | 112333200102132210303330 |
5 | 101223231322111201022 |
6 | 555022204424200140 |
7 | 30204516100124634 |
oct | 2677402236446374 |
9 | 437032022231366 |
10 | 101121020022012 |
11 | 2a247202645891 |
12 | b411b21009050 |
13 | 4456895a26463 |
14 | 1ad83d7c416c4 |
15 | ba55ca82535c |
hex | 5bf8127a4cfc |
101121020022012 has 24 divisors (see below), whose sum is σ = 236266609385856. Its totient is φ = 33661640578608.
The previous prime is 101121020021941. The next prime is 101121020022037. The reversal of 101121020022012 is 210220020121101.
It is a junction number, because it is equal to n+sod(n) for n = 101121020021982 and 101121020022000.
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, 5670752638 + ... + 5670770469.
It is an arithmetic number, because the mean of its divisors is an integer number (9844442057744).
Almost surely, 2101121020022012 is an apocalyptic number.
101121020022012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
101121020022012 is an abundant number, since it is smaller than the sum of its proper divisors (135145589363844).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101121020022012 is a wasteful number, since it uses less digits than its factorization.
101121020022012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11341523857 (or 11341523855 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 101121020022012 its reverse (210220020121101), we get a palindrome (311341040143113).
The spelling of 101121020022012 in words is "one hundred one trillion, one hundred twenty-one billion, twenty million, twenty-two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •