Base | Representation |
---|---|
bin | 1001001100000101011001… |
… | …0001000110001101011011 |
3 | 1022202212011002210221120222 |
4 | 2103001112101012031123 |
5 | 2311012333330341101 |
6 | 33253203434110255 |
7 | 2061634654320302 |
oct | 223012621061533 |
9 | 38685132727528 |
10 | 10103210402651 |
11 | 3245824978153 |
12 | 11720a087b38b |
13 | 583961b096b2 |
14 | 26cdd86c5439 |
15 | 127c1ae3301b |
hex | 9305644635b |
10103210402651 has 32 divisors (see below), whose sum is σ = 10944099936000. Its totient is φ = 9295871050368.
The previous prime is 10103210402633. The next prime is 10103210402653. The reversal of 10103210402651 is 15620401230101.
It is not a de Polignac number, because 10103210402651 - 214 = 10103210386267 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10103210402651.
It is not an unprimeable number, because it can be changed into a prime (10103210402653) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 144587960 + ... + 144657818.
It is an arithmetic number, because the mean of its divisors is an integer number (342003123000).
Almost surely, 210103210402651 is an apocalyptic number.
10103210402651 is a deficient number, since it is larger than the sum of its proper divisors (840889533349).
10103210402651 is a wasteful number, since it uses less digits than its factorization.
10103210402651 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 70923.
The product of its (nonzero) digits is 1440, while the sum is 26.
Adding to 10103210402651 its reverse (15620401230101), we get a palindrome (25723611632752).
The spelling of 10103210402651 in words is "ten trillion, one hundred three billion, two hundred ten million, four hundred two thousand, six hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •