Base | Representation |
---|---|
bin | 11000001100011001110000… |
… | …010000000111001011011001 |
3 | 111221202020221111020111020020 |
4 | 120030121300100013023121 |
5 | 102421321231141004001 |
6 | 1014145544540221053 |
7 | 31261352036631630 |
oct | 3014316020071331 |
9 | 457666844214206 |
10 | 106405403063001 |
11 | 309a4307056149 |
12 | bb260b623a789 |
13 | 474aca9317473 |
14 | 1c3c0985c6517 |
15 | c47cae673736 |
hex | 60c6704072d9 |
106405403063001 has 32 divisors (see below), whose sum is σ = 169664706060288. Its totient is φ = 58035646869120.
The previous prime is 106405403062961. The next prime is 106405403063009. The reversal of 106405403063001 is 100360304504601.
It is not a de Polignac number, because 106405403063001 - 211 = 106405403060953 is a prime.
It is a super-2 number, since 2×1064054030630012 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (106405403063009) 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, 1119467271 + ... + 1119562316.
It is an arithmetic number, because the mean of its divisors is an integer number (5302022064384).
Almost surely, 2106405403063001 is an apocalyptic number.
It is an amenable number.
106405403063001 is a deficient number, since it is larger than the sum of its proper divisors (63259302997287).
106405403063001 is a wasteful number, since it uses less digits than its factorization.
106405403063001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2239029701.
The product of its (nonzero) digits is 25920, while the sum is 33.
Adding to 106405403063001 its reverse (100360304504601), we get a palindrome (206765707567602).
The spelling of 106405403063001 in words is "one hundred six trillion, four hundred five billion, four hundred three million, sixty-three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •