Base | Representation |
---|---|
bin | 1001010001110001101111… |
… | …0000100011100100000011 |
3 | 1100010012121010201202220001 |
4 | 2110130123300203210003 |
5 | 2314113133314311121 |
6 | 33410140344100431 |
7 | 2101666420116643 |
oct | 224343360434403 |
9 | 40105533652801 |
10 | 10201013041411 |
11 | 3283252a16225 |
12 | 1189036764717 |
13 | 58cc4a2cc88a |
14 | 273a35994523 |
15 | 12a5422c2991 |
hex | 9471bc23903 |
10201013041411 has 4 divisors (see below), whose sum is σ = 10201020154024. Its totient is φ = 10201005928800.
The previous prime is 10201013041403. The next prime is 10201013041433. The reversal of 10201013041411 is 11414031010201.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 10201013041411 - 23 = 10201013041403 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10201013041111) 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 3 ways as a sum of consecutive naturals, for example, 567945 + ... + 4552426.
It is an arithmetic number, because the mean of its divisors is an integer number (2550255038506).
Almost surely, 210201013041411 is an apocalyptic number.
10201013041411 is a deficient number, since it is larger than the sum of its proper divisors (7112613).
10201013041411 is an equidigital number, since it uses as much as digits as its factorization.
10201013041411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7112612.
The product of its (nonzero) digits is 96, while the sum is 19.
Adding to 10201013041411 its reverse (11414031010201), we get a palindrome (21615044051612).
The spelling of 10201013041411 in words is "ten trillion, two hundred one billion, thirteen million, forty-one thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •