Base | Representation |
---|---|
bin | 101111001110000011… |
… | …1101010000111111111 |
3 | 100200201222120120202021 |
4 | 1132130013222013333 |
5 | 3130133244013210 |
6 | 114330100541011 |
7 | 10216605352213 |
oct | 1363407520777 |
9 | 320658516667 |
10 | 101403501055 |
11 | 3a0066a622a |
12 | 1779b9b1767 |
13 | 974051593c |
14 | 4c9d604943 |
15 | 2987571bda |
hex | 179c1ea1ff |
101403501055 has 4 divisors (see below), whose sum is σ = 121684201272. Its totient is φ = 81122800840.
The previous prime is 101403501019. The next prime is 101403501061. The reversal of 101403501055 is 550105304101.
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: 550105304101 = 43 ⋅12793146607.
It is not a de Polignac number, because 101403501055 - 219 = 101402976767 is a prime.
It is a super-2 number, since 2×1014035010552 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
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 3 ways as a sum of consecutive naturals, for example, 10140350101 + ... + 10140350110.
It is an arithmetic number, because the mean of its divisors is an integer number (30421050318).
Almost surely, 2101403501055 is an apocalyptic number.
101403501055 is a deficient number, since it is larger than the sum of its proper divisors (20280700217).
101403501055 is an equidigital number, since it uses as much as digits as its factorization.
101403501055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20280700216.
The product of its (nonzero) digits is 1500, while the sum is 25.
Adding to 101403501055 its reverse (550105304101), we get a palindrome (651508805156).
The spelling of 101403501055 in words is "one hundred one billion, four hundred three million, five hundred one thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •