Base | Representation |
---|---|
bin | 1001101011111110000101… |
… | …1011111101111101010101 |
3 | 1101201020002221010021122120 |
4 | 2122333201123331331111 |
5 | 2344001230032211203 |
6 | 34353001001450153 |
7 | 2146336601225550 |
oct | 232774133757525 |
9 | 41636087107576 |
10 | 10651006132053 |
11 | 3437080321561 |
12 | 12402a04a0959 |
13 | 5c350212ba51 |
14 | 28b7235a9697 |
15 | 1370ccb48b53 |
hex | 9afe16fdf55 |
10651006132053 has 32 divisors (see below), whose sum is σ = 16311440643072. Its totient is φ = 6055850908800.
The previous prime is 10651006132003. The next prime is 10651006132057. The reversal of 10651006132053 is 35023160015601.
It is not a de Polignac number, because 10651006132053 - 29 = 10651006131541 is a prime.
It is a super-2 number, since 2×106510061320532 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10651006132057) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2771550 + ... + 5383632.
It is an arithmetic number, because the mean of its divisors is an integer number (509732520096).
Almost surely, 210651006132053 is an apocalyptic number.
It is an amenable number.
10651006132053 is a deficient number, since it is larger than the sum of its proper divisors (5660434511019).
10651006132053 is a wasteful number, since it uses less digits than its factorization.
10651006132053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2613065.
The product of its (nonzero) digits is 16200, while the sum is 33.
Adding to 10651006132053 its reverse (35023160015601), we get a palindrome (45674166147654).
The spelling of 10651006132053 in words is "ten trillion, six hundred fifty-one billion, six million, one hundred thirty-two thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •