Base | Representation |
---|---|
bin | 101111010001111100… |
… | …1101011100000101001 |
3 | 100201002002020101022212 |
4 | 1132203321223200221 |
5 | 3130420204220231 |
6 | 114351043054505 |
7 | 10223052136301 |
oct | 1364371534051 |
9 | 321062211285 |
10 | 101534054441 |
11 | 3a073365996 |
12 | 17817671435 |
13 | 9761596271 |
14 | 4cb2aaa601 |
15 | 2993c5e42b |
hex | 17a3e6b829 |
101534054441 has 8 divisors (see below), whose sum is σ = 102104952000. Its totient is φ = 100964627568.
The previous prime is 101534054423. The next prime is 101534054471. The reversal of 101534054441 is 144450435101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101534054441 is a prime.
It is a super-2 number, since 2×1015340544412 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101534054398 and 101534054407.
It is not an unprimeable number, because it can be changed into a prime (101534054471) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 229061 + ... + 505506.
It is an arithmetic number, because the mean of its divisors is an integer number (12763119000).
Almost surely, 2101534054441 is an apocalyptic number.
It is an amenable number.
101534054441 is a deficient number, since it is larger than the sum of its proper divisors (570897559).
101534054441 is an equidigital number, since it uses as much as digits as its factorization.
101534054441 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 735343.
The product of its (nonzero) digits is 19200, while the sum is 32.
Adding to 101534054441 its reverse (144450435101), we get a palindrome (245984489542).
The spelling of 101534054441 in words is "one hundred one billion, five hundred thirty-four million, fifty-four thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •