Base | Representation |
---|---|
bin | 10110111111010110011010… |
… | …010100010001100110000111 |
3 | 111021000001122121101110211122 |
4 | 112333112122110101212013 |
5 | 101223043112003340401 |
6 | 555013252155024155 |
7 | 30203662214346515 |
oct | 2677263224214607 |
9 | 437001577343748 |
10 | 101110414121351 |
11 | 2a24275a912728 |
12 | b40ba6113b05b |
13 | 44558956556ab |
14 | 1ad7aad43b4b5 |
15 | ba51a968121b |
hex | 5bf59a511987 |
101110414121351 has 16 divisors (see below), whose sum is σ = 114818999407200. Its totient is φ = 88453155068928.
The previous prime is 101110414121323. The next prime is 101110414121357. The reversal of 101110414121351 is 153121414011101.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101110414121351 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 101110414121351.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101110414121357) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2953146446 + ... + 2953180683.
It is an arithmetic number, because the mean of its divisors is an integer number (7176187462950).
Almost surely, 2101110414121351 is an apocalyptic number.
101110414121351 is a deficient number, since it is larger than the sum of its proper divisors (13708585285849).
101110414121351 is a wasteful number, since it uses less digits than its factorization.
101110414121351 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5906327218.
The product of its (nonzero) digits is 480, while the sum is 26.
Adding to 101110414121351 its reverse (153121414011101), we get a palindrome (254231828132452).
The spelling of 101110414121351 in words is "one hundred one trillion, one hundred ten billion, four hundred fourteen million, one hundred twenty-one thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •