Base | Representation |
---|---|
bin | 11011100000111011100010… |
… | …100110000010101111001000 |
3 | 120212110110111121112102112211 |
4 | 123200323202212002233020 |
5 | 111330112402304033000 |
6 | 1105211153443514504 |
7 | 34326461550322312 |
oct | 3340734246025710 |
9 | 525413447472484 |
10 | 121010210221000 |
11 | 35615161a38281 |
12 | 116a470a688a34 |
13 | 526a2a1b082a9 |
14 | 21c4cd551c7b2 |
15 | decb474527ba |
hex | 6e0ee2982bc8 |
121010210221000 has 64 divisors (see below), whose sum is σ = 283187890093680. Its totient is φ = 48399981836800.
The previous prime is 121010210220983. The next prime is 121010210221049. The reversal of 121010210221000 is 122012010121.
It can be written as a sum of positive squares in 8 ways, for example, as 9738556283556 + 111271653937444 = 3120666^2 + 10548538^2 .
It is a super-2 number, since 2×1210102102210002 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6691092 + ... + 16934908.
Almost surely, 2121010210221000 is an apocalyptic number.
121010210221000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
121010210221000 is an abundant number, since it is smaller than the sum of its proper divisors (162177679872680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121010210221000 is a wasteful number, since it uses less digits than its factorization.
121010210221000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10255651 (or 10255637 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 121010210221000 its reverse (122012010121), we get a palindrome (121132222231121).
The spelling of 121010210221000 in words is "one hundred twenty-one trillion, ten billion, two hundred ten million, two hundred twenty-one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •