Base | Representation |
---|---|
bin | 1110101010101… |
… | …11001001000001 |
3 | 22120112002120221 |
4 | 13111113021001 |
5 | 222444242241 |
6 | 20113103041 |
7 | 3022553065 |
oct | 725271101 |
9 | 276462527 |
10 | 123040321 |
11 | 634a9018 |
12 | 35257a81 |
13 | 1c64ca31 |
14 | 124abaa5 |
15 | ac065d1 |
hex | 7557241 |
123040321 has 4 divisors (see below), whose sum is σ = 124258644. Its totient is φ = 121822000.
The previous prime is 123040319. The next prime is 123040327.
It is a happy number.
123040321 is nontrivially palindromic in base 10.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 88360000 + 34680321 = 9400^2 + 5889^2 .
It is a cyclic number.
It is not a de Polignac number, because 123040321 - 21 = 123040319 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 123040295 and 123040304.
It is not an unprimeable number, because it can be changed into a prime (123040327) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 609010 + ... + 609211.
It is an arithmetic number, because the mean of its divisors is an integer number (31064661).
Almost surely, 2123040321 is an apocalyptic number.
It is an amenable number.
123040321 is a deficient number, since it is larger than the sum of its proper divisors (1218323).
123040321 is a wasteful number, since it uses less digits than its factorization.
123040321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1218322.
The product of its (nonzero) digits is 144, while the sum is 16.
The square root of 123040321 is about 11092.3541685253. The cubic root of 123040321 is about 497.3733199339.
The spelling of 123040321 in words is "one hundred twenty-three million, forty thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •