Base | Representation |
---|---|
bin | 11110100101101001010… |
… | …11011111011011000001 |
3 | 10201110211020011112101221 |
4 | 33102310223133123001 |
5 | 114204423322220001 |
6 | 2122454012355041 |
7 | 135634561550665 |
oct | 17226453373301 |
9 | 3643736145357 |
10 | 1051003320001 |
11 | 375800a7a128 |
12 | 14b836a75a81 |
13 | 78155b6892b |
14 | 38c2410a8a5 |
15 | 1c5142461a1 |
hex | f4b4adf6c1 |
1051003320001 has 8 divisors (see below), whose sum is σ = 1056487655264. Its totient is φ = 1045519384320.
The previous prime is 1051003319959. The next prime is 1051003320023. The reversal of 1051003320001 is 1000233001501.
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 1051003320001 - 29 = 1051003319489 is a prime.
It is a super-2 number, since 2×10510033200012 (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 (1051003320061) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6210430 + ... + 6377416.
It is an arithmetic number, because the mean of its divisors is an integer number (132060956908).
Almost surely, 21051003320001 is an apocalyptic number.
It is an amenable number.
1051003320001 is a deficient number, since it is larger than the sum of its proper divisors (5484335263).
1051003320001 is a wasteful number, since it uses less digits than its factorization.
1051003320001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 199791.
The product of its (nonzero) digits is 90, while the sum is 16.
Adding to 1051003320001 its reverse (1000233001501), we get a palindrome (2051236321502).
The spelling of 1051003320001 in words is "one trillion, fifty-one billion, three million, three hundred twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •