Base | Representation |
---|---|
bin | 10011001101000111… |
… | …01111110010101111 |
3 | 222121120011210202001 |
4 | 21212203233302233 |
5 | 132104002101143 |
6 | 4423035313131 |
7 | 513335332102 |
oct | 114643576257 |
9 | 28546153661 |
10 | 10310581423 |
11 | 441106647a |
12 | 1bb8bab7a7 |
13 | c8415166c |
14 | 6db4cc739 |
15 | 4052ac14d |
hex | 2668efcaf |
10310581423 has 4 divisors (see below), whose sum is σ = 10316805520. Its totient is φ = 10304357328.
The previous prime is 10310581367. The next prime is 10310581429. The reversal of 10310581423 is 32418501301.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 32418501301 = 61 ⋅531450841.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10310581423 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10310581391 and 10310581400.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10310581429) 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, 3109563 + ... + 3112876.
It is an arithmetic number, because the mean of its divisors is an integer number (2579201380).
Almost surely, 210310581423 is an apocalyptic number.
10310581423 is a deficient number, since it is larger than the sum of its proper divisors (6224097).
10310581423 is an equidigital number, since it uses as much as digits as its factorization.
10310581423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6224096.
The product of its (nonzero) digits is 2880, while the sum is 28.
It can be divided in two parts, 103105 and 81423, that added together give a triangular number (184528 = T607).
The spelling of 10310581423 in words is "ten billion, three hundred ten million, five hundred eighty-one thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •