Base | Representation |
---|---|
bin | 11011100100001001011101… |
… | …001011001100010111100110 |
3 | 120220020121012102222122102012 |
4 | 123210021131023030113212 |
5 | 111342223210342042410 |
6 | 1105500521153514222 |
7 | 34351446610354223 |
oct | 3344113513142746 |
9 | 526217172878365 |
10 | 121231310112230 |
11 | 3569aa0107900a |
12 | 1171b534572972 |
13 | 52850a96453b6 |
14 | 21d18ab9d694a |
15 | e03787ea6605 |
hex | 6e425d2cc5e6 |
121231310112230 has 64 divisors (see below), whose sum is σ = 229475423882880. Its totient is φ = 46046058777600.
The previous prime is 121231310112193. The next prime is 121231310112239. The reversal of 121231310112230 is 32211013132121.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 121231310112196 and 121231310112205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121231310112239) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 120800615 + ... + 121800045.
It is an arithmetic number, because the mean of its divisors is an integer number (3585553498170).
Almost surely, 2121231310112230 is an apocalyptic number.
121231310112230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
121231310112230 is a deficient number, since it is larger than the sum of its proper divisors (108244113770650).
121231310112230 is a wasteful number, since it uses less digits than its factorization.
121231310112230 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1006385.
The product of its (nonzero) digits is 432, while the sum is 23.
Adding to 121231310112230 its reverse (32211013132121), we get a palindrome (153442323244351).
The spelling of 121231310112230 in words is "one hundred twenty-one trillion, two hundred thirty-one billion, three hundred ten million, one hundred twelve thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •