Base | Representation |
---|---|
bin | 100111001110100111… |
… | …101101010010110101 |
3 | 11000201111111202002101 |
4 | 213032213231102311 |
5 | 1142231013040201 |
6 | 31203351542101 |
7 | 3020542321315 |
oct | 471647552265 |
9 | 130644452071 |
10 | 42121221301 |
11 | 16955370aa5 |
12 | 81b638a931 |
13 | 3c836906b3 |
14 | 20781bd445 |
15 | 1167d41d01 |
hex | 9ce9ed4b5 |
42121221301 has 8 divisors (see below), whose sum is σ = 43154496000. Its totient is φ = 41088228960.
The previous prime is 42121221287. The next prime is 42121221349. The reversal of 42121221301 is 10312212124.
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 42121221301 - 213 = 42121213109 is a prime.
It is a super-2 number, since 2×421212213012 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42121221001) 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, 248940 + ... + 382378.
It is an arithmetic number, because the mean of its divisors is an integer number (5394312000).
Almost surely, 242121221301 is an apocalyptic number.
42121221301 is a gapful number since it is divisible by the number (41) formed by its first and last digit.
It is an amenable number.
42121221301 is a deficient number, since it is larger than the sum of its proper divisors (1033274699).
42121221301 is a wasteful number, since it uses less digits than its factorization.
42121221301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 141179.
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 42121221301 its reverse (10312212124), we get a palindrome (52433433425).
The spelling of 42121221301 in words is "forty-two billion, one hundred twenty-one million, two hundred twenty-one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •