Base | Representation |
---|---|
bin | 111000011100111100… |
… | …0100011111111101110 |
3 | 102120220202000220121200 |
4 | 1300321320203333232 |
5 | 3441234413304402 |
6 | 131405320110330 |
7 | 11521124544345 |
oct | 1607170437756 |
9 | 376822026550 |
10 | 121230213102 |
11 | 47460327469 |
12 | 1b5b39053a6 |
13 | b58002980b |
14 | 5c2089cb5c |
15 | 3247ead21c |
hex | 1c39e23fee |
121230213102 has 48 divisors (see below), whose sum is σ = 285633056592. Its totient is φ = 37005085440.
The previous prime is 121230213079. The next prime is 121230213107. The reversal of 121230213102 is 201312032121.
121230213102 is a `hidden beast` number, since 121 + 230 + 2 + 1 + 310 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121230213107) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 5342424 + ... + 5365067.
It is an arithmetic number, because the mean of its divisors is an integer number (5950688679).
Almost surely, 2121230213102 is an apocalyptic number.
121230213102 is an abundant number, since it is smaller than the sum of its proper divisors (164402843490).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121230213102 is a wasteful number, since it uses less digits than its factorization.
121230213102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10707553 (or 10707550 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 121230213102 its reverse (201312032121), we get a palindrome (322542245223).
The spelling of 121230213102 in words is "one hundred twenty-one billion, two hundred thirty million, two hundred thirteen thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.122 sec. • engine limits •