Base | Representation |
---|---|
bin | 111001010010000101… |
… | …0001010000000001001 |
3 | 102202112000001112201022 |
4 | 1302210022022000021 |
5 | 4003412340210441 |
6 | 132302252002225 |
7 | 11613245014364 |
oct | 1624412120011 |
9 | 382460045638 |
10 | 123013210121 |
11 | 4819582851a |
12 | 1ba10a60375 |
13 | b7a5545639 |
14 | 5d4d5cb0db |
15 | 32ee7a884b |
hex | 1ca428a009 |
123013210121 has 4 divisors (see below), whose sum is σ = 125630512512. Its totient is φ = 120395907732.
The previous prime is 123013210069. The next prime is 123013210129. The reversal of 123013210121 is 121012310321.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 123013210121 - 210 = 123013209097 is a prime.
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 123013210121.
It is not an unprimeable number, because it can be changed into a prime (123013210129) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1308651125 + ... + 1308651218.
It is an arithmetic number, because the mean of its divisors is an integer number (31407628128).
Almost surely, 2123013210121 is an apocalyptic number.
It is an amenable number.
123013210121 is a deficient number, since it is larger than the sum of its proper divisors (2617302391).
123013210121 is an equidigital number, since it uses as much as digits as its factorization.
123013210121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2617302390.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 123013210121 its reverse (121012310321), we get a palindrome (244025520442).
The spelling of 123013210121 in words is "one hundred twenty-three billion, thirteen million, two hundred ten thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •