Base | Representation |
---|---|
bin | 111001010010111110… |
… | …0111110101101010101 |
3 | 102202121002200210120020 |
4 | 1302211330332231111 |
5 | 4003443041413141 |
6 | 132305245055353 |
7 | 11614061611353 |
oct | 1624574765525 |
9 | 382532623506 |
10 | 123043310421 |
11 | 482008172a9 |
12 | 1ba1ab57559 |
13 | b7ab854175 |
14 | 5d535c47d3 |
15 | 3302252266 |
hex | 1ca5f3eb55 |
123043310421 has 8 divisors (see below), whose sum is σ = 165102701664. Its totient is φ = 81506396400.
The previous prime is 123043310399. The next prime is 123043310431. The reversal of 123043310421 is 124013340321.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 123043310421 - 213 = 123043302229 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 123043310391 and 123043310400.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (123043310431) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 130618755 + ... + 130619696.
It is an arithmetic number, because the mean of its divisors is an integer number (20637837708).
Almost surely, 2123043310421 is an apocalyptic number.
It is an amenable number.
123043310421 is a deficient number, since it is larger than the sum of its proper divisors (42059391243).
123043310421 is a wasteful number, since it uses less digits than its factorization.
123043310421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 261238611.
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 123043310421 its reverse (124013340321), we get a palindrome (247056650742).
The spelling of 123043310421 in words is "one hundred twenty-three billion, forty-three million, three hundred ten thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •