Base | Representation |
---|---|
bin | 100101101011100… |
… | …0010010111101111 |
3 | 10021010001122000022 |
4 | 1023113002113233 |
5 | 10042132031343 |
6 | 325242552355 |
7 | 43221425642 |
oct | 11327022757 |
9 | 3233048008 |
10 | 1264330223 |
11 | 599755012 |
12 | 2b35086bb |
13 | 171c293c0 |
14 | bdcb7a59 |
15 | 75ee6568 |
hex | 4b5c25ef |
1264330223 has 4 divisors (see below), whose sum is σ = 1361586408. Its totient is φ = 1167074040.
The previous prime is 1264330189. The next prime is 1264330321. The reversal of 1264330223 is 3220334621.
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 1264330223 - 26 = 1264330159 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1264330192 and 1264330201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1264335223) 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, 48628073 + ... + 48628098.
It is an arithmetic number, because the mean of its divisors is an integer number (340396602).
Almost surely, 21264330223 is an apocalyptic number.
1264330223 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
1264330223 is a deficient number, since it is larger than the sum of its proper divisors (97256185).
1264330223 is an equidigital number, since it uses as much as digits as its factorization.
1264330223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 97256184.
The product of its (nonzero) digits is 5184, while the sum is 26.
The square root of 1264330223 is about 35557.4214897537. The cubic root of 1264330223 is about 1081.3181844001.
Adding to 1264330223 its reverse (3220334621), we get a palindrome (4484664844).
The spelling of 1264330223 in words is "one billion, two hundred sixty-four million, three hundred thirty thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •