Base | Representation |
---|---|
bin | 11110101000000111110… |
… | …00111100000000011111 |
3 | 10201121020211202220211012 |
4 | 33110003320330000133 |
5 | 114220134023320043 |
6 | 2123233524045435 |
7 | 136012526331653 |
oct | 17240370740037 |
9 | 3647224686735 |
10 | 1052332245023 |
11 | 376323133174 |
12 | 14bb47b3387b |
13 | 783082904b7 |
14 | 38d0c7daa63 |
15 | 1c590c4ba18 |
hex | f503e3c01f |
1052332245023 has 2 divisors, whose sum is σ = 1052332245024. Its totient is φ = 1052332245022.
The previous prime is 1052332244983. The next prime is 1052332245067. The reversal of 1052332245023 is 3205422332501.
1052332245023 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1052332245023 - 26 = 1052332244959 is a prime.
It is a super-3 number, since 3×10523322450233 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1052332245823) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 526166122511 + 526166122512.
It is an arithmetic number, because the mean of its divisors is an integer number (526166122512).
Almost surely, 21052332245023 is an apocalyptic number.
1052332245023 is a deficient number, since it is larger than the sum of its proper divisors (1).
1052332245023 is an equidigital number, since it uses as much as digits as its factorization.
1052332245023 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 43200, while the sum is 32.
Adding to 1052332245023 its reverse (3205422332501), we get a palindrome (4257754577524).
The spelling of 1052332245023 in words is "one trillion, fifty-two billion, three hundred thirty-two million, two hundred forty-five thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •