Base | Representation |
---|---|
bin | 1001011110001000001111… |
… | …0000011010010010101001 |
3 | 1100212111022121001201021220 |
4 | 2113202003300122102221 |
5 | 2331102224033401101 |
6 | 34051432503452253 |
7 | 2123221040016036 |
oct | 227420360322251 |
9 | 40774277051256 |
10 | 10413211231401 |
11 | 33552442a5080 |
12 | 1202197457089 |
13 | 5a6c66855a44 |
14 | 280005b2438d |
15 | 130d115b5636 |
hex | 97883c1a4a9 |
10413211231401 has 32 divisors (see below), whose sum is σ = 15362105466240. Its totient is φ = 6221733312000.
The previous prime is 10413211231369. The next prime is 10413211231429.
10413211231401 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 10413211231401 - 25 = 10413211231369 is a prime.
It is not an unprimeable number, because it can be changed into a prime (10413211231441) 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 31 ways as a sum of consecutive naturals, for example, 5927866 + ... + 7481043.
It is an arithmetic number, because the mean of its divisors is an integer number (480065795820).
Almost surely, 210413211231401 is an apocalyptic number.
10413211231401 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10413211231401 is a deficient number, since it is larger than the sum of its proper divisors (4948894234839).
10413211231401 is a wasteful number, since it uses less digits than its factorization.
10413211231401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13409257.
The product of its (nonzero) digits is 576, while the sum is 24.
It can be divided in two parts, 1041321 and 1231401, that added together give a palindrome (2272722).
The spelling of 10413211231401 in words is "ten trillion, four hundred thirteen billion, two hundred eleven million, two hundred thirty-one thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •