Base | Representation |
---|---|
bin | 11011100010100100101011… |
… | …111101101101110010101010 |
3 | 120212212020220210222100102112 |
4 | 123202210223331231302222 |
5 | 111333440112220010010 |
6 | 1105335104432402322 |
7 | 34340566405266002 |
oct | 3342445375556252 |
9 | 525766823870375 |
10 | 121123110313130 |
11 | 3565902810a542 |
12 | 117025786a63a2 |
13 | 5277b250a8b33 |
14 | 21ca56593d002 |
15 | e00a53e56a05 |
hex | 6e292bf6dcaa |
121123110313130 has 16 divisors (see below), whose sum is σ = 223091868298464. Its totient is φ = 47322517517520.
The previous prime is 121123110313129. The next prime is 121123110313159. The reversal of 121123110313130 is 31313011321121.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 121123110313096 and 121123110313105.
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, 140840825516 + ... + 140840826375.
It is an arithmetic number, because the mean of its divisors is an integer number (13943241768654).
Almost surely, 2121123110313130 is an apocalyptic number.
121123110313130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
121123110313130 is a deficient number, since it is larger than the sum of its proper divisors (101968757985334).
121123110313130 is a wasteful number, since it uses less digits than its factorization.
121123110313130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 281681651941.
The product of its (nonzero) digits is 324, while the sum is 23.
Adding to 121123110313130 its reverse (31313011321121), we get a palindrome (152436121634251).
The spelling of 121123110313130 in words is "one hundred twenty-one trillion, one hundred twenty-three billion, one hundred ten million, three hundred thirteen thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •