Base | Representation |
---|---|
bin | 11110101000010101010… |
… | …00110010001101111001 |
3 | 10201121112201210101101221 |
4 | 33110022220302031321 |
5 | 114220402013414004 |
6 | 2123253050312041 |
7 | 136015402505632 |
oct | 17241250621571 |
9 | 3647481711357 |
10 | 1052445451129 |
11 | 376381024636 |
12 | 14bb79a28621 |
13 | 78325878c67 |
14 | 38d1d868889 |
15 | 1c59ab5e354 |
hex | f50aa32379 |
1052445451129 has 8 divisors (see below), whose sum is σ = 1074894318720. Its totient is φ = 1029998934096.
The previous prime is 1052445451097. The next prime is 1052445451147. The reversal of 1052445451129 is 9211545442501.
1052445451129 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1052445451129 - 25 = 1052445451097 is a prime.
It is a super-2 number, since 2×10524454511292 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1052445451429) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 332602 + ... + 1488460.
It is an arithmetic number, because the mean of its divisors is an integer number (134361789840).
Almost surely, 21052445451129 is an apocalyptic number.
It is an amenable number.
1052445451129 is a deficient number, since it is larger than the sum of its proper divisors (22448867591).
1052445451129 is a wasteful number, since it uses less digits than its factorization.
1052445451129 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1175279.
The product of its (nonzero) digits is 288000, while the sum is 43.
The spelling of 1052445451129 in words is "one trillion, fifty-two billion, four hundred forty-five million, four hundred fifty-one thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •