Base | Representation |
---|---|
bin | 1100001101110100000001… |
… | …0101101001011011000111 |
3 | 1202120000220022000200001112 |
4 | 3003131000111221123013 |
5 | 3230030043142313421 |
6 | 44322152551115235 |
7 | 2554250441361425 |
oct | 303350025513307 |
9 | 52500808020045 |
10 | 13431442151111 |
11 | 4309273a34646 |
12 | 160b12a972b1b |
13 | 76576c3a7caa |
14 | 346129d98115 |
15 | 1845b15c845b |
hex | c37405696c7 |
13431442151111 has 8 divisors (see below), whose sum is σ = 13438465286400. Its totient is φ = 13424420828160.
The previous prime is 13431442151033. The next prime is 13431442151131. The reversal of 13431442151111 is 11115124413431.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13431442151111 - 226 = 13431375042247 is a prime.
It is a super-3 number, since 3×134314421511113 (a number of 40 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13431442151131) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 14501735 + ... + 15400103.
It is an arithmetic number, because the mean of its divisors is an integer number (1679808160800).
Almost surely, 213431442151111 is an apocalyptic number.
13431442151111 is a deficient number, since it is larger than the sum of its proper divisors (7023135289).
13431442151111 is an equidigital number, since it uses as much as digits as its factorization.
13431442151111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 906169.
The product of its digits is 5760, while the sum is 32.
Adding to 13431442151111 its reverse (11115124413431), we get a palindrome (24546566564542).
The spelling of 13431442151111 in words is "thirteen trillion, four hundred thirty-one billion, four hundred forty-two million, one hundred fifty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •