Base | Representation |
---|---|
bin | 10011000001100010… |
… | …01110111001101111 |
3 | 222100210102012011201 |
4 | 21200301032321233 |
5 | 131404121002143 |
6 | 4405245430331 |
7 | 511045631065 |
oct | 114061167157 |
9 | 28323365151 |
10 | 10213453423 |
11 | 43712567a8 |
12 | 1b9056b3a7 |
13 | c69ca5184 |
14 | 6cc648035 |
15 | 3eb9c364d |
hex | 260c4ee6f |
10213453423 has 4 divisors (see below), whose sum is σ = 10225100200. Its totient is φ = 10201806648.
The previous prime is 10213453417. The next prime is 10213453441. The reversal of 10213453423 is 32435431201.
It is a happy number.
10213453423 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 10213453423 - 221 = 10211356271 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10213453391 and 10213453400.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10213453403) 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, 5822073 + ... + 5823826.
It is an arithmetic number, because the mean of its divisors is an integer number (2556275050).
Almost surely, 210213453423 is an apocalyptic number.
10213453423 is a deficient number, since it is larger than the sum of its proper divisors (11646777).
10213453423 is an equidigital number, since it uses as much as digits as its factorization.
10213453423 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11646776.
The product of its (nonzero) digits is 8640, while the sum is 28.
Adding to 10213453423 its reverse (32435431201), we get a palindrome (42648884624).
The spelling of 10213453423 in words is "ten billion, two hundred thirteen million, four hundred fifty-three thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •