Base | Representation |
---|---|
bin | 10011011010100001… |
… | …00110100001110101 |
3 | 222220101201102111112 |
4 | 21231100212201311 |
5 | 132321242101003 |
6 | 4442133044405 |
7 | 516202031405 |
oct | 115520464165 |
9 | 28811642445 |
10 | 10423003253 |
11 | 4469571683 |
12 | 202a786705 |
13 | ca1524160 |
14 | 70c3d4805 |
15 | 4100b73d8 |
hex | 26d426875 |
10423003253 has 4 divisors (see below), whose sum is σ = 11224772748. Its totient is φ = 9621233760.
The previous prime is 10423003249. The next prime is 10423003277. The reversal of 10423003253 is 35230032401.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1134477124 + 9288526129 = 33682^2 + 96377^2 .
It is a cyclic number.
It is not a de Polignac number, because 10423003253 - 22 = 10423003249 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10423003153) 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, 400884728 + ... + 400884753.
It is an arithmetic number, because the mean of its divisors is an integer number (2806193187).
Almost surely, 210423003253 is an apocalyptic number.
10423003253 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
10423003253 is a deficient number, since it is larger than the sum of its proper divisors (801769495).
10423003253 is an equidigital number, since it uses as much as digits as its factorization.
10423003253 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 801769494.
The product of its (nonzero) digits is 2160, while the sum is 23.
Adding to 10423003253 its reverse (35230032401), we get a palindrome (45653035654).
The spelling of 10423003253 in words is "ten billion, four hundred twenty-three million, three thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •