Base | Representation |
---|---|
bin | 1011000000010100110111… |
… | …1110100010101011000101 |
3 | 1120211202210220121020001012 |
4 | 2300011031332202223011 |
5 | 3041222233131112123 |
6 | 41422434110412005 |
7 | 2356133002302032 |
oct | 260051576425305 |
9 | 46752726536035 |
10 | 12100231113413 |
11 | 3945752013923 |
12 | 1435132b01005 |
13 | 69a07c05b311 |
14 | 2db923600389 |
15 | 15eb4c5ad378 |
hex | b014dfa2ac5 |
12100231113413 has 32 divisors (see below), whose sum is σ = 14095650067200. Its totient is φ = 10303131902976.
The previous prime is 12100231113287. The next prime is 12100231113437. The reversal of 12100231113413 is 31431113200121.
It is not a de Polignac number, because 12100231113413 - 226 = 12100164004549 is a prime.
It is a super-3 number, since 3×121002311134133 (a number of 40 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12100231118413) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3225443 + ... + 5882511.
It is an arithmetic number, because the mean of its divisors is an integer number (440489064600).
Almost surely, 212100231113413 is an apocalyptic number.
It is an amenable number.
12100231113413 is a deficient number, since it is larger than the sum of its proper divisors (1995418953787).
12100231113413 is a wasteful number, since it uses less digits than its factorization.
12100231113413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2657741.
The product of its (nonzero) digits is 432, while the sum is 23.
Adding to 12100231113413 its reverse (31431113200121), we get a palindrome (43531344313534).
The spelling of 12100231113413 in words is "twelve trillion, one hundred billion, two hundred thirty-one million, one hundred thirteen thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •