Base | Representation |
---|---|
bin | 100101000001011… |
… | …1111111110001101 |
3 | 10012120121101122021 |
4 | 1022002333332031 |
5 | 10021012102201 |
6 | 323134450141 |
7 | 42533243524 |
oct | 11202777615 |
9 | 3176541567 |
10 | 1242300301 |
11 | 588278670 |
12 | 2a8063951 |
13 | 16a4b5048 |
14 | badc14bb |
15 | 740e3ea1 |
hex | 4a0bff8d |
1242300301 has 8 divisors (see below), whose sum is σ = 1355819904. Its totient is φ = 1128877920.
The previous prime is 1242300299. The next prime is 1242300307. The reversal of 1242300301 is 1030032421.
It is a happy number.
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 1242300301 - 21 = 1242300299 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 (1242300307) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3841 + ... + 49993.
It is an arithmetic number, because the mean of its divisors is an integer number (169477488).
Almost surely, 21242300301 is an apocalyptic number.
1242300301 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1242300301 is a deficient number, since it is larger than the sum of its proper divisors (113519603).
1242300301 is a wasteful number, since it uses less digits than its factorization.
1242300301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 48611.
The product of its (nonzero) digits is 144, while the sum is 16.
The square root of 1242300301 is about 35246.2806690295. The cubic root of 1242300301 is about 1075.0009882089. Note that the first 3 decimals are identical.
Adding to 1242300301 its reverse (1030032421), we get a palindrome (2272332722).
The spelling of 1242300301 in words is "one billion, two hundred forty-two million, three hundred thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.126 sec. • engine limits •