Base | Representation |
---|---|
bin | 1100001001100… |
… | …01001100010011 |
3 | 21002202201212000 |
4 | 12010301030103 |
5 | 202042211423 |
6 | 14040205043 |
7 | 2345151336 |
oct | 604611423 |
9 | 232681760 |
10 | 101913363 |
11 | 52589022 |
12 | 2a169783 |
13 | 18163686 |
14 | d76c61d |
15 | 8e31843 |
hex | 6131313 |
101913363 has 8 divisors (see below), whose sum is σ = 150982800. Its totient is φ = 67942224.
The previous prime is 101913353. The next prime is 101913367. The reversal of 101913363 is 363319101.
It is not a de Polignac number, because 101913363 - 24 = 101913347 is a prime.
It is a super-3 number, since 3×1019133633 (a number of 25 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 3774569 = 101913363 / (1 + 0 + 1 + 9 + 1 + 3 + 3 + 6 + 3).
It is not an unprimeable number, because it can be changed into a prime (101913367) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1887258 + ... + 1887311.
It is an arithmetic number, because the mean of its divisors is an integer number (18872850).
Almost surely, 2101913363 is an apocalyptic number.
101913363 is a deficient number, since it is larger than the sum of its proper divisors (49069437).
101913363 is an equidigital number, since it uses as much as digits as its factorization.
101913363 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3774578 (or 3774572 counting only the distinct ones).
The product of its (nonzero) digits is 1458, while the sum is 27.
The square root of 101913363 is about 10095.2148565546. The cubic root of 101913363 is about 467.1005489116.
The spelling of 101913363 in words is "one hundred one million, nine hundred thirteen thousand, three hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •