Base | Representation |
---|---|
bin | 1100001101001110010010… |
… | …0110100010100111101111 |
3 | 1202112001202101111122122110 |
4 | 3003103210212202213233 |
5 | 3224343322131004411 |
6 | 44313355515215103 |
7 | 2553441436251402 |
oct | 303234446424757 |
9 | 52461671448573 |
10 | 13421313141231 |
11 | 4304a464145a6 |
12 | 1609182747493 |
13 | 764816a5a918 |
14 | 345848a51d39 |
15 | 1841bc2352a6 |
hex | c34e49a29ef |
13421313141231 has 64 divisors (see below), whose sum is σ = 18688135864320. Its totient is φ = 8558499840000.
The previous prime is 13421313141217. The next prime is 13421313141239. The reversal of 13421313141231 is 13214131312431.
It is a happy number.
It is not a de Polignac number, because 13421313141231 - 26 = 13421313141167 is a prime.
It is a super-2 number, since 2×134213131412312 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13421313141239) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 2006471935 + ... + 2006478623.
It is an arithmetic number, because the mean of its divisors is an integer number (292002122880).
Almost surely, 213421313141231 is an apocalyptic number.
13421313141231 is a deficient number, since it is larger than the sum of its proper divisors (5266822723089).
13421313141231 is a wasteful number, since it uses less digits than its factorization.
13421313141231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7608.
The product of its digits is 5184, while the sum is 30.
Adding to 13421313141231 its reverse (13214131312431), we get a palindrome (26635444453662).
The spelling of 13421313141231 in words is "thirteen trillion, four hundred twenty-one billion, three hundred thirteen million, one hundred forty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •