Base | Representation |
---|---|
bin | 1000100100011100… |
… | …0000000111110101 |
3 | 12221022110001201120 |
4 | 2021013000013311 |
5 | 14202340022401 |
6 | 1020131414153 |
7 | 111001230051 |
oct | 21107000765 |
9 | 5838401646 |
10 | 2300314101 |
11 | a80516038 |
12 | 542454359 |
13 | 2a8755107 |
14 | 17b710c61 |
15 | d6e34836 |
hex | 891c01f5 |
2300314101 has 8 divisors (see below), whose sum is σ = 3067421280. Its totient is φ = 1533374832.
The previous prime is 2300314099. The next prime is 2300314117. The reversal of 2300314101 is 1014130032.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2300314101 - 21 = 2300314099 is a prime.
It is a super-3 number, since 3×23003141013 (a number of 29 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2300314151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5475 + ... + 68048.
It is an arithmetic number, because the mean of its divisors is an integer number (383427660).
Almost surely, 22300314101 is an apocalyptic number.
It is an amenable number.
2300314101 is a deficient number, since it is larger than the sum of its proper divisors (767107179).
2300314101 is a wasteful number, since it uses less digits than its factorization.
2300314101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 83955.
The product of its (nonzero) digits is 72, while the sum is 15.
The square root of 2300314101 is about 47961.5898506294. The cubic root of 2300314101 is about 1320.0662082264.
Adding to 2300314101 its reverse (1014130032), we get a palindrome (3314444133).
The spelling of 2300314101 in words is "two billion, three hundred million, three hundred fourteen thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •