Base | Representation |
---|---|
bin | 1100101001101011101000… |
… | …0110100001000001001011 |
3 | 1211020210201121000021101111 |
4 | 3022122322012201001023 |
5 | 3310401120422442411 |
6 | 45330134134431151 |
7 | 2633660243210461 |
oct | 312327206410113 |
9 | 54223647007344 |
10 | 13910226374731 |
11 | 4483326171255 |
12 | 1687a8a8024b7 |
13 | 79b961cc1b1b |
14 | 36138965a831 |
15 | 191c8488a721 |
hex | ca6ba1a104b |
13910226374731 has 4 divisors (see below), whose sum is σ = 14389889353200. Its totient is φ = 13430563396264.
The previous prime is 13910226374687. The next prime is 13910226374753. The reversal of 13910226374731 is 13747362201931.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13910226374731 is a prime.
It is a super-2 number, since 2×139102263747312 (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 (13910224374731) 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 3 ways as a sum of consecutive naturals, for example, 239831489191 + ... + 239831489248.
It is an arithmetic number, because the mean of its divisors is an integer number (3597472338300).
Almost surely, 213910226374731 is an apocalyptic number.
13910226374731 is a deficient number, since it is larger than the sum of its proper divisors (479662978469).
13910226374731 is an equidigital number, since it uses as much as digits as its factorization.
13910226374731 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 479662978468.
The product of its (nonzero) digits is 1143072, while the sum is 49.
The spelling of 13910226374731 in words is "thirteen trillion, nine hundred ten billion, two hundred twenty-six million, three hundred seventy-four thousand, seven hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •