Base | Representation |
---|---|
bin | 11110100111111011111… |
… | …11011111110011111101 |
3 | 10201120222221121001110211 |
4 | 33103331333133303331 |
5 | 114214433211114440 |
6 | 2123220031232421 |
7 | 136010215326100 |
oct | 17237577376375 |
9 | 3646887531424 |
10 | 1052233301245 |
11 | 3762822a3255 |
12 | 14bb1a978711 |
13 | 782c0929699 |
14 | 38cdd602737 |
15 | 1c587204eea |
hex | f4fdfdfcfd |
1052233301245 has 12 divisors (see below), whose sum is σ = 1468831792284. Its totient is φ = 721531406400.
The previous prime is 1052233301191. The next prime is 1052233301293. The reversal of 1052233301245 is 5421033322501.
It can be written as a sum of positive squares in 2 ways, for example, as 618734840409 + 433498460836 = 786597^2 + 658406^2 .
It is not a de Polignac number, because 1052233301245 - 215 = 1052233268477 is a prime.
It is a super-2 number, since 2×10522333012452 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2147414656 + ... + 2147415145.
It is an arithmetic number, because the mean of its divisors is an integer number (122402649357).
Almost surely, 21052233301245 is an apocalyptic number.
It is an amenable number.
1052233301245 is a deficient number, since it is larger than the sum of its proper divisors (416598491039).
1052233301245 is an equidigital number, since it uses as much as digits as its factorization.
1052233301245 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4294829820 (or 4294829813 counting only the distinct ones).
The product of its (nonzero) digits is 21600, while the sum is 31.
Adding to 1052233301245 its reverse (5421033322501), we get a palindrome (6473266623746).
The spelling of 1052233301245 in words is "one trillion, fifty-two billion, two hundred thirty-three million, three hundred one thousand, two hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •