Base | Representation |
---|---|
bin | 111100111111011… |
… | …001101100000101 |
3 | 2122022102122120122 |
4 | 330333121230011 |
5 | 4043423101003 |
6 | 245311511325 |
7 | 34233336431 |
oct | 7477315405 |
9 | 2568378518 |
10 | 1023253253 |
11 | 485666350 |
12 | 246828545 |
13 | 133cbc2c9 |
14 | 99c819c1 |
15 | 5ec76238 |
hex | 3cfd9b05 |
1023253253 has 4 divisors (see below), whose sum is σ = 1116276288. Its totient is φ = 930230220.
The previous prime is 1023253243. The next prime is 1023253261. The reversal of 1023253253 is 3523523201.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 3523523201 = 11 ⋅320320291.
It is a cyclic number.
It is not a de Polignac number, because 1023253253 - 216 = 1023187717 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 (1023253213) 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, 46511501 + ... + 46511522.
It is an arithmetic number, because the mean of its divisors is an integer number (279069072).
Almost surely, 21023253253 is an apocalyptic number.
It is an amenable number.
1023253253 is a deficient number, since it is larger than the sum of its proper divisors (93023035).
1023253253 is an equidigital number, since it uses as much as digits as its factorization.
1023253253 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 93023034.
The product of its (nonzero) digits is 5400, while the sum is 26.
The square root of 1023253253 is about 31988.3299501553. The cubic root of 1023253253 is about 1007.6917693278.
Adding to 1023253253 its reverse (3523523201), we get a palindrome (4546776454).
The spelling of 1023253253 in words is "one billion, twenty-three million, two hundred fifty-three thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •