Base | Representation |
---|---|
bin | 11101111111000101110… |
… | …01111100001011010101 |
3 | 10122111101122210022100122 |
4 | 32333202321330023111 |
5 | 113340030312221003 |
6 | 2105152022521325 |
7 | 134302615462031 |
oct | 16774271741325 |
9 | 3574348708318 |
10 | 1030304023253 |
11 | 367a4984110a |
12 | 14781a896245 |
13 | 76207639a4b |
14 | 37c1cdd11c1 |
15 | 1bc01de6238 |
hex | efe2e7c2d5 |
1030304023253 has 2 divisors, whose sum is σ = 1030304023254. Its totient is φ = 1030304023252.
The previous prime is 1030304023249. The next prime is 1030304023267. The reversal of 1030304023253 is 3523204030301.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 843535707364 + 186768315889 = 918442^2 + 432167^2 .
It is a cyclic number.
It is not a de Polignac number, because 1030304023253 - 22 = 1030304023249 is a prime.
It is a super-3 number, since 3×10303040232533 (a number of 37 digits) contains 333 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1030304023453) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 515152011626 + 515152011627.
It is an arithmetic number, because the mean of its divisors is an integer number (515152011627).
Almost surely, 21030304023253 is an apocalyptic number.
It is an amenable number.
1030304023253 is a deficient number, since it is larger than the sum of its proper divisors (1).
1030304023253 is an equidigital number, since it uses as much as digits as its factorization.
1030304023253 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6480, while the sum is 26.
Adding to 1030304023253 its reverse (3523204030301), we get a palindrome (4553508053554).
The spelling of 1030304023253 in words is "one trillion, thirty billion, three hundred four million, twenty-three thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •