Base | Representation |
---|---|
bin | 11000001100100010110011… |
… | …110000101010011110011110 |
3 | 111221210012001001220202111201 |
4 | 120030202303300222132132 |
5 | 102422001134123314004 |
6 | 1014154233412110114 |
7 | 31262145005106145 |
oct | 3014426360523636 |
9 | 457705031822451 |
10 | 106415125604254 |
11 | 309a8446192305 |
12 | bb27b6a30533a |
13 | 474bb98699b5c |
14 | 1c3c73b96275c |
15 | c4817cec66a4 |
hex | 60c8b3c2a79e |
106415125604254 has 32 divisors (see below), whose sum is σ = 165878915069952. Its totient is φ = 51145284060000.
The previous prime is 106415125604239. The next prime is 106415125604317. The reversal of 106415125604254 is 452406521514601.
It is a super-2 number, since 2×1064151256042542 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 98051544 + ... + 99130900.
It is an arithmetic number, because the mean of its divisors is an integer number (5183716095936).
Almost surely, 2106415125604254 is an apocalyptic number.
106415125604254 is a deficient number, since it is larger than the sum of its proper divisors (59463789465698).
106415125604254 is a wasteful number, since it uses less digits than its factorization.
106415125604254 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1090072.
The product of its (nonzero) digits is 1152000, while the sum is 46.
The spelling of 106415125604254 in words is "one hundred six trillion, four hundred fifteen billion, one hundred twenty-five million, six hundred four thousand, two hundred fifty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •