Base | Representation |
---|---|
bin | 10011011010100110… |
… | …00100100101010001 |
3 | 222220102221022112212 |
4 | 21231103010211101 |
5 | 132321423310031 |
6 | 4442155001505 |
7 | 516210366005 |
oct | 115523044521 |
9 | 28812838485 |
10 | 10423650641 |
11 | 4469974008 |
12 | 202aa39295 |
13 | ca16bca21 |
14 | 70c522705 |
15 | 41019412b |
hex | 26d4c4951 |
10423650641 has 4 divisors (see below), whose sum is σ = 10783086900. Its totient is φ = 10064214384.
The previous prime is 10423650631. The next prime is 10423650661. The reversal of 10423650641 is 14605632401.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 14605632401 = 23399 ⋅624199.
It can be written as a sum of positive squares in 2 ways, for example, as 6072929041 + 4350721600 = 77929^2 + 65960^2 .
It is a cyclic number.
It is not a de Polignac number, because 10423650641 - 226 = 10356541777 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10423650598 and 10423650607.
It is not an unprimeable number, because it can be changed into a prime (10423650631) 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, 179718086 + ... + 179718143.
It is an arithmetic number, because the mean of its divisors is an integer number (2695771725).
Almost surely, 210423650641 is an apocalyptic number.
It is an amenable number.
10423650641 is a deficient number, since it is larger than the sum of its proper divisors (359436259).
10423650641 is an equidigital number, since it uses as much as digits as its factorization.
10423650641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 359436258.
The product of its (nonzero) digits is 17280, while the sum is 32.
The spelling of 10423650641 in words is "ten billion, four hundred twenty-three million, six hundred fifty thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •