Base | Representation |
---|---|
bin | 101111010001000100… |
… | …0010101111111010101 |
3 | 100201000000022221021221 |
4 | 1132202020111333111 |
5 | 3130340103002041 |
6 | 114344102210341 |
7 | 10222241455063 |
oct | 1364210257725 |
9 | 321000287257 |
10 | 101504344021 |
11 | 3a058613023 |
12 | 178097239b1 |
13 | 9758393032 |
14 | 4cacb75033 |
15 | 29913412d1 |
hex | 17a2215fd5 |
101504344021 has 4 divisors (see below), whose sum is σ = 101505008844. Its totient is φ = 101503679200.
The previous prime is 101504343973. The next prime is 101504344033. The reversal of 101504344021 is 120443405101.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It can be written as a sum of positive squares in 2 ways, for example, as 1360576996 + 100143767025 = 36886^2 + 316455^2 .
It is a cyclic number.
It is not a de Polignac number, because 101504344021 - 27 = 101504343893 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101504344121) 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, 23961 + ... + 451201.
It is an arithmetic number, because the mean of its divisors is an integer number (25376252211).
Almost surely, 2101504344021 is an apocalyptic number.
It is an amenable number.
101504344021 is a deficient number, since it is larger than the sum of its proper divisors (664823).
101504344021 is an equidigital number, since it uses as much as digits as its factorization.
101504344021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 664822.
The product of its (nonzero) digits is 1920, while the sum is 25.
Adding to 101504344021 its reverse (120443405101), we get a palindrome (221947749122).
The spelling of 101504344021 in words is "one hundred one billion, five hundred four million, three hundred forty-four thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •