Base | Representation |
---|---|
bin | 111000011001101101… |
… | …1111000110111100011 |
3 | 102120122012110210120210 |
4 | 1300303123320313203 |
5 | 3441024220024443 |
6 | 131350453305203 |
7 | 11515342203000 |
oct | 1606333706743 |
9 | 376565423523 |
10 | 121122033123 |
11 | 47405259223 |
12 | 1b583635203 |
13 | b5637b09b0 |
14 | 5c1037c8a7 |
15 | 323d73ec33 |
hex | 1c336f8de3 |
121122033123 has 32 divisors (see below), whose sum is σ = 202820800000. Its totient is φ = 63888537888.
The previous prime is 121122033103. The next prime is 121122033127. The reversal of 121122033123 is 321330221121.
It is not a de Polignac number, because 121122033123 - 25 = 121122033091 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a self number, because there is not a number n which added to its sum of digits gives 121122033123.
It is not an unprimeable number, because it can be changed into a prime (121122033127) 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, 4513873 + ... + 4540626.
It is an arithmetic number, because the mean of its divisors is an integer number (6338150000).
Almost surely, 2121122033123 is an apocalyptic number.
121122033123 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
121122033123 is a deficient number, since it is larger than the sum of its proper divisors (81698766877).
121122033123 is an equidigital number, since it uses as much as digits as its factorization.
121122033123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9054536 (or 9054522 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 121122033123 its reverse (321330221121), we get a palindrome (442452254244).
The spelling of 121122033123 in words is "one hundred twenty-one billion, one hundred twenty-two million, thirty-three thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •