Base | Representation |
---|---|
bin | 111001010101010010… |
… | …1011101101110100101 |
3 | 102202210111221110122222 |
4 | 1302222211131232211 |
5 | 4004122441011401 |
6 | 132321103002125 |
7 | 11616024335234 |
oct | 1625245355645 |
9 | 382714843588 |
10 | 123121032101 |
11 | 482406817a1 |
12 | 1ba40b99345 |
13 | b7c1997522 |
14 | 5d5da56b1b |
15 | 3308ea5c1b |
hex | 1caa95dba5 |
123121032101 has 8 divisors (see below), whose sum is σ = 130371093504. Its totient is φ = 115871820480.
The previous prime is 123121032071. The next prime is 123121032103. The reversal of 123121032101 is 101230121321.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 123121032101 - 26 = 123121032037 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 123121032101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (123121032103) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 98906 + ... + 505988.
It is an arithmetic number, because the mean of its divisors is an integer number (16296386688).
Almost surely, 2123121032101 is an apocalyptic number.
It is an amenable number.
123121032101 is a deficient number, since it is larger than the sum of its proper divisors (7250061403).
123121032101 is a wasteful number, since it uses less digits than its factorization.
123121032101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 424891.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 123121032101 its reverse (101230121321), we get a palindrome (224351153422).
The spelling of 123121032101 in words is "one hundred twenty-three billion, one hundred twenty-one million, thirty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •