Base | Representation |
---|---|
bin | 101111001011000110… |
… | …1101000111010001001 |
3 | 100200111002010000101202 |
4 | 1132112031220322021 |
5 | 3124432411440031 |
6 | 114312200553545 |
7 | 10214263145255 |
oct | 1362615507211 |
9 | 320432100352 |
10 | 101304405641 |
11 | 39a6577239a |
12 | 177727828b5 |
13 | 9725b2aaba |
14 | 4c903ab265 |
15 | 297d9ea2cb |
hex | 1796368e89 |
101304405641 has 4 divisors (see below), whose sum is σ = 101305531284. Its totient is φ = 101303280000.
The previous prime is 101304405613. The next prime is 101304405649. The reversal of 101304405641 is 146504403101.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 23256250000 + 78048155641 = 152500^2 + 279371^2 .
It is a cyclic number.
It is not a de Polignac number, because 101304405641 - 218 = 101304143497 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101304405649) 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 3 ways as a sum of consecutive naturals, for example, 414860 + ... + 612141.
It is an arithmetic number, because the mean of its divisors is an integer number (25326382821).
Almost surely, 2101304405641 is an apocalyptic number.
It is an amenable number.
101304405641 is a deficient number, since it is larger than the sum of its proper divisors (1125643).
101304405641 is an equidigital number, since it uses as much as digits as its factorization.
101304405641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1125642.
The product of its (nonzero) digits is 5760, while the sum is 29.
Adding to 101304405641 its reverse (146504403101), we get a palindrome (247808808742).
The spelling of 101304405641 in words is "one hundred one billion, three hundred four million, four hundred five thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •