Base | Representation |
---|---|
bin | 1001010010011000000110… |
… | …0000100000010010110101 |
3 | 1100011012011202100201102221 |
4 | 2110212001200200102311 |
5 | 2314300230332404331 |
6 | 33415002220402341 |
7 | 2102512532156440 |
oct | 224460140402265 |
9 | 40135152321387 |
10 | 10211310044341 |
11 | 32876573479aa |
12 | 118b02b0a63b1 |
13 | 590bcb6a8913 |
14 | 27433134a657 |
15 | 12a94629b711 |
hex | 949818204b5 |
10211310044341 has 8 divisors (see below), whose sum is σ = 11867866395840. Its totient is φ = 8604203136288.
The previous prime is 10211310044281. The next prime is 10211310044389. The reversal of 10211310044341 is 14344001311201.
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 10211310044341 - 29 = 10211310043829 is a prime.
It is a super-2 number, since 2×102113100443412 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10211310024341) 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, 12362360416 + ... + 12362361241.
It is an arithmetic number, because the mean of its divisors is an integer number (1483483299480).
Almost surely, 210211310044341 is an apocalyptic number.
It is an amenable number.
10211310044341 is a deficient number, since it is larger than the sum of its proper divisors (1656556351499).
10211310044341 is an equidigital number, since it uses as much as digits as its factorization.
10211310044341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24724721723.
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 10211310044341 its reverse (14344001311201), we get a palindrome (24555311355542).
The spelling of 10211310044341 in words is "ten trillion, two hundred eleven billion, three hundred ten million, forty-four thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •