Base | Representation |
---|---|
bin | 1100000100111… |
… | …00001100001011 |
3 | 21001121201122212 |
4 | 12002130030023 |
5 | 201413144201 |
6 | 14015135335 |
7 | 2340030113 |
oct | 602341413 |
9 | 231551585 |
10 | 101303051 |
11 | 52201533 |
12 | 29b1454b |
13 | 17cab945 |
14 | d650043 |
15 | 8d60abb |
hex | 609c30b |
101303051 has 8 divisors (see below), whose sum is σ = 107359200. Its totient is φ = 95257728.
The previous prime is 101303047. The next prime is 101303057. The reversal of 101303051 is 150303101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 101303051 - 22 = 101303047 is a prime.
It is a super-3 number, since 3×1013030513 (a number of 25 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101303057) 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, 24410 + ... + 28256.
It is an arithmetic number, because the mean of its divisors is an integer number (13419900).
Almost surely, 2101303051 is an apocalyptic number.
101303051 is a deficient number, since it is larger than the sum of its proper divisors (6056149).
101303051 is a wasteful number, since it uses less digits than its factorization.
101303051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5413.
The product of its (nonzero) digits is 45, while the sum is 14.
The square root of 101303051 is about 10064.9416789170. The cubic root of 101303051 is about 466.1662650337.
Adding to 101303051 its reverse (150303101), we get a palindrome (251606152).
Subtracting 101303051 from its reverse (150303101), we obtain a triangular number (49000050 = T9899).
The spelling of 101303051 in words is "one hundred one million, three hundred three thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •