Base | Representation |
---|---|
bin | 10011011001010111… |
… | …10100101111001001 |
3 | 222212201120121100120 |
4 | 21230223310233021 |
5 | 132311310041441 |
6 | 4441150253453 |
7 | 516024055221 |
oct | 115453645711 |
9 | 28781517316 |
10 | 10413362121 |
11 | 44640870a8 |
12 | 20274b7289 |
13 | c9c529a46 |
14 | 70b005081 |
15 | 40e310966 |
hex | 26caf4bc9 |
10413362121 has 8 divisors (see below), whose sum is σ = 14701217184. Its totient is φ = 6533874240.
The previous prime is 10413362119. The next prime is 10413362131. The reversal of 10413362121 is 12126331401.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10413362121 - 21 = 10413362119 is a prime.
It is a super-2 number, since 2×104133621212 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10413362091 and 10413362100.
It is not an unprimeable number, because it can be changed into a prime (10413362131) 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, 102091735 + ... + 102091836.
It is an arithmetic number, because the mean of its divisors is an integer number (1837652148).
Almost surely, 210413362121 is an apocalyptic number.
It is an amenable number.
10413362121 is a deficient number, since it is larger than the sum of its proper divisors (4287855063).
10413362121 is a wasteful number, since it uses less digits than its factorization.
10413362121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 204183591.
The product of its (nonzero) digits is 864, while the sum is 24.
Adding to 10413362121 its reverse (12126331401), we get a palindrome (22539693522).
The spelling of 10413362121 in words is "ten billion, four hundred thirteen million, three hundred sixty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •