Base | Representation |
---|---|
bin | 111001010010000011… |
… | …0110001010001110101 |
3 | 102202111221101110000112 |
4 | 1302210012301101311 |
5 | 4003412123304141 |
6 | 132302220552405 |
7 | 11613234326342 |
oct | 1624406612165 |
9 | 382457343015 |
10 | 123012322421 |
11 | 4819528158a |
12 | 1ba106b2705 |
13 | b7a52c4581 |
14 | 5d4d4397c9 |
15 | 32ee6807eb |
hex | 1ca41b1475 |
123012322421 has 4 divisors (see below), whose sum is σ = 129486655200. Its totient is φ = 116537989644.
The previous prime is 123012322397. The next prime is 123012322429. The reversal of 123012322421 is 124223210321.
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 123012322421 - 218 = 123012060277 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (123012322429) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3237166361 + ... + 3237166398.
It is an arithmetic number, because the mean of its divisors is an integer number (32371663800).
Almost surely, 2123012322421 is an apocalyptic number.
It is an amenable number.
123012322421 is a deficient number, since it is larger than the sum of its proper divisors (6474332779).
123012322421 is an equidigital number, since it uses as much as digits as its factorization.
123012322421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6474332778.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 123012322421 its reverse (124223210321), we get a palindrome (247235532742).
The spelling of 123012322421 in words is "one hundred twenty-three billion, twelve million, three hundred twenty-two thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •