Base | Representation |
---|---|
bin | 101111000011101011… |
… | …1111100110101010101 |
3 | 100122211201122210002020 |
4 | 1132013113330311111 |
5 | 3123430143403303 |
6 | 114231345003353 |
7 | 10205151104346 |
oct | 1360727746525 |
9 | 318751583066 |
10 | 101055450453 |
11 | 39948192701 |
12 | 17703323559 |
13 | 96b6392b39 |
14 | 4c692c40cd |
15 | 2966c20a53 |
hex | 17875fcd55 |
101055450453 has 4 divisors (see below), whose sum is σ = 134740600608. Its totient is φ = 67370300300.
The previous prime is 101055450427. The next prime is 101055450487. The reversal of 101055450453 is 354054550101.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 101055450453 - 217 = 101055319381 is a prime.
It is a super-3 number, since 3×1010554504533 (a number of 34 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101055450493) by changing a digit.
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, 16842575073 + ... + 16842575078.
It is an arithmetic number, because the mean of its divisors is an integer number (33685150152).
Almost surely, 2101055450453 is an apocalyptic number.
It is an amenable number.
101055450453 is a deficient number, since it is larger than the sum of its proper divisors (33685150155).
101055450453 is an equidigital number, since it uses as much as digits as its factorization.
101055450453 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33685150154.
The product of its (nonzero) digits is 30000, while the sum is 33.
The spelling of 101055450453 in words is "one hundred one billion, fifty-five million, four hundred fifty thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.800 sec. • engine limits •