Base | Representation |
---|---|
bin | 110000001010001111… |
… | …1100011100001111101 |
3 | 100212221201200100121020 |
4 | 1200110133203201331 |
5 | 3143302244001141 |
6 | 115302322254353 |
7 | 10320630155643 |
oct | 1402437434175 |
9 | 325851610536 |
10 | 103423031421 |
11 | 3a952672296 |
12 | 180641b73b9 |
13 | 99a2a3a718 |
14 | 5011905193 |
15 | 2a549e1266 |
hex | 18147e387d |
103423031421 has 8 divisors (see below), whose sum is σ = 137900017920. Its totient is φ = 68947366272.
The previous prime is 103423031357. The next prime is 103423031567. The reversal of 103423031421 is 124130324301.
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 103423031421 - 26 = 103423031357 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 103423031391 and 103423031400.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103423031021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 130420 + ... + 473133.
It is an arithmetic number, because the mean of its divisors is an integer number (17237502240).
Almost surely, 2103423031421 is an apocalyptic number.
It is an amenable number.
103423031421 is a deficient number, since it is larger than the sum of its proper divisors (34476986499).
103423031421 is an equidigital number, since it uses as much as digits as its factorization.
103423031421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 660675.
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 103423031421 its reverse (124130324301), we get a palindrome (227553355722).
The spelling of 103423031421 in words is "one hundred three billion, four hundred twenty-three million, thirty-one thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.112 sec. • engine limits •