Base | Representation |
---|---|
bin | 1010111011001111111011… |
… | …0010001000001101110011 |
3 | 1120112102122211201200221111 |
4 | 2232303332302020031303 |
5 | 3033310112244111311 |
6 | 41314410351534151 |
7 | 2346624262444633 |
oct | 256637662101563 |
9 | 46472584650844 |
10 | 12013003113331 |
11 | 3911760096360 |
12 | 142024a52a357 |
13 | 691a8a61169c |
14 | 2d760a9186c3 |
15 | 15c744789d21 |
hex | aecfec88373 |
12013003113331 has 16 divisors (see below), whose sum is σ = 13112185580928. Its totient is φ = 10915004016000.
The previous prime is 12013003113313. The next prime is 12013003113389. The reversal of 12013003113331 is 13331130031021.
It is a cyclic number.
It is not a de Polignac number, because 12013003113331 - 29 = 12013003112819 is a prime.
It is a super-2 number, since 2×120130031133312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12013003113311) 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, 182460640 + ... + 182526466.
It is an arithmetic number, because the mean of its divisors is an integer number (819511598808).
Almost surely, 212013003113331 is an apocalyptic number.
12013003113331 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
12013003113331 is a deficient number, since it is larger than the sum of its proper divisors (1099182467597).
12013003113331 is a wasteful number, since it uses less digits than its factorization.
12013003113331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 74562.
The product of its (nonzero) digits is 486, while the sum is 22.
Adding to 12013003113331 its reverse (13331130031021), we get a palindrome (25344133144352).
The spelling of 12013003113331 in words is "twelve trillion, thirteen billion, three million, one hundred thirteen thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •