Base | Representation |
---|---|
bin | 101111000011101011… |
… | …0110001111001111111 |
3 | 100122211201002012002111 |
4 | 1132013112301321333 |
5 | 3123430104043201 |
6 | 114231334234451 |
7 | 10205145355525 |
oct | 1360726617177 |
9 | 318751065074 |
10 | 101055143551 |
11 | 39947aa306a |
12 | 177031b5a27 |
13 | 96b62b623b |
14 | 4c69244315 |
15 | 2966baeb51 |
hex | 17875b1e7f |
101055143551 has 4 divisors (see below), whose sum is σ = 102478455504. Its totient is φ = 99631831600.
The previous prime is 101055143549. The next prime is 101055143557. The reversal of 101055143551 is 155341550101.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 155341550101 = 37 ⋅4198420273.
It is a cyclic number.
It is not a de Polignac number, because 101055143551 - 21 = 101055143549 is a prime.
It is a super-2 number, since 2×1010551435512 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101055143557) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 711655870 + ... + 711656011.
It is an arithmetic number, because the mean of its divisors is an integer number (25619613876).
Almost surely, 2101055143551 is an apocalyptic number.
101055143551 is a deficient number, since it is larger than the sum of its proper divisors (1423311953).
101055143551 is an equidigital number, since it uses as much as digits as its factorization.
101055143551 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1423311952.
The product of its (nonzero) digits is 7500, while the sum is 31.
Adding to 101055143551 its reverse (155341550101), we get a palindrome (256396693652).
The spelling of 101055143551 in words is "one hundred one billion, fifty-five million, one hundred forty-three thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •