Base | Representation |
---|---|
bin | 1011111011110110111111… |
… | …1100100000110001010001 |
3 | 1201110112202122202200101220 |
4 | 2332331233330200301101 |
5 | 3210001402311114441 |
6 | 43524342514315253 |
7 | 2523051152632341 |
oct | 276755774406121 |
9 | 51415678680356 |
10 | 13123003223121 |
11 | 41aa4862268a0 |
12 | 157b3ab288b29 |
13 | 74265611508c |
14 | 33522a172d21 |
15 | 17b55d11b466 |
hex | bef6ff20c51 |
13123003223121 has 16 divisors (see below), whose sum is σ = 19917917936640. Its totient is φ = 7607538099920.
The previous prime is 13123003223111. The next prime is 13123003223159. The reversal of 13123003223121 is 12132230032131.
It is not a de Polignac number, because 13123003223121 - 25 = 13123003223089 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13123003223091 and 13123003223100.
It is not an unprimeable number, because it can be changed into a prime (13123003223111) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8644928901 + ... + 8644930418.
It is an arithmetic number, because the mean of its divisors is an integer number (1244869871040).
Almost surely, 213123003223121 is an apocalyptic number.
13123003223121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
13123003223121 is a deficient number, since it is larger than the sum of its proper divisors (6794914713519).
13123003223121 is a wasteful number, since it uses less digits than its factorization.
13123003223121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17289859356.
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 13123003223121 its reverse (12132230032131), we get a palindrome (25255233255252).
The spelling of 13123003223121 in words is "thirteen trillion, one hundred twenty-three billion, three million, two hundred twenty-three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •