Base | Representation |
---|---|
bin | 11011100000111011100010… |
… | …100110000010101111010100 |
3 | 120212110110111121112102120021 |
4 | 123200323202212002233110 |
5 | 111330112402304033022 |
6 | 1105211153443514524 |
7 | 34326461550322330 |
oct | 3340734246025724 |
9 | 525413447472507 |
10 | 121010210221012 |
11 | 35615161a38292 |
12 | 116a470a688a44 |
13 | 526a2a1b082b8 |
14 | 21c4cd551c7c0 |
15 | decb474527c7 |
hex | 6e0ee2982bd4 |
121010210221012 has 24 divisors (see below), whose sum is σ = 246586843472256. Its totient is φ = 50882999445408.
The previous prime is 121010210220983. The next prime is 121010210221049. The reversal of 121010210221012 is 210122012010121.
It is a super-2 number, since 2×1210102102210122 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 40771632688 + ... + 40771635655.
It is an arithmetic number, because the mean of its divisors is an integer number (10274451811344).
Almost surely, 2121010210221012 is an apocalyptic number.
It is an amenable number.
121010210221012 is an abundant number, since it is smaller than the sum of its proper divisors (125576633251244).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121010210221012 is a wasteful number, since it uses less digits than its factorization.
121010210221012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 81543268407 (or 81543268405 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 121010210221012 its reverse (210122012010121), we get a palindrome (331132222231133).
The spelling of 121010210221012 in words is "one hundred twenty-one trillion, ten billion, two hundred ten million, two hundred twenty-one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •