Base | Representation |
---|---|
bin | 11110101001011011011… |
… | …11100000000010101011 |
3 | 10201200001210000210220220 |
4 | 33110231233200002223 |
5 | 114223103302224001 |
6 | 2123431330021123 |
7 | 136036113556401 |
oct | 17245557400253 |
9 | 3650053023826 |
10 | 1053034414251 |
11 | 376653524316 |
12 | 1501031177a3 |
13 | 783ba8ac051 |
14 | 38d77b7b471 |
15 | 1c5d26ebc36 |
hex | f52dbe00ab |
1053034414251 has 8 divisors (see below), whose sum is σ = 1404052664784. Its totient is φ = 702019553280.
The previous prime is 1053034414249. The next prime is 1053034414253. The reversal of 1053034414251 is 1524144303501.
It is an interprime number because it is at equal distance from previous prime (1053034414249) and next prime (1053034414253).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1053034414251 - 21 = 1053034414249 is a prime.
It is a super-2 number, since 2×10530344142512 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1053034414253) 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, 2010 + ... + 1451231.
It is an arithmetic number, because the mean of its divisors is an integer number (175506583098).
Almost surely, 21053034414251 is an apocalyptic number.
1053034414251 is a deficient number, since it is larger than the sum of its proper divisors (351018250533).
1053034414251 is a wasteful number, since it uses less digits than its factorization.
1053034414251 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1694781.
The product of its (nonzero) digits is 28800, while the sum is 33.
Adding to 1053034414251 its reverse (1524144303501), we get a palindrome (2577178717752).
The spelling of 1053034414251 in words is "one trillion, fifty-three billion, thirty-four million, four hundred fourteen thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •