Base | Representation |
---|---|
bin | 1000111111010110… |
… | …1000011001111101 |
3 | 20020011212022110121 |
4 | 2033311220121331 |
5 | 14420234413041 |
6 | 1035243134541 |
7 | 113541604330 |
oct | 21765503175 |
9 | 6204768417 |
10 | 2413201021 |
11 | 1029209710 |
12 | 574214451 |
13 | 2c5c5b4ca |
14 | 18c6d8617 |
15 | e1cd27d1 |
hex | 8fd6867d |
2413201021 has 8 divisors (see below), whose sum is σ = 3008666304. Its totient is φ = 1880416320.
The previous prime is 2413200997. The next prime is 2413201061. The reversal of 2413201021 is 1201023142.
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 2413201021 - 25 = 2413200989 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2413200986 and 2413201004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2413201061) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 15670060 + ... + 15670213.
It is an arithmetic number, because the mean of its divisors is an integer number (376083288).
Almost surely, 22413201021 is an apocalyptic number.
It is an amenable number.
2413201021 is a deficient number, since it is larger than the sum of its proper divisors (595465283).
2413201021 is a wasteful number, since it uses less digits than its factorization.
2413201021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31340291.
The product of its (nonzero) digits is 96, while the sum is 16.
The square root of 2413201021 is about 49124.3424485255. The cubic root of 2413201021 is about 1341.3161904366.
Adding to 2413201021 its reverse (1201023142), we get a palindrome (3614224163).
The spelling of 2413201021 in words is "two billion, four hundred thirteen million, two hundred one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •