Base | Representation |
---|---|
bin | 11000111001010111… |
… | …10100010100011111 |
3 | 1021111111202210102120 |
4 | 30130223310110133 |
5 | 204333213303211 |
6 | 10050150554023 |
7 | 652140255414 |
oct | 143453642437 |
9 | 37444683376 |
10 | 13366150431 |
11 | 5739930717 |
12 | 2710368913 |
13 | 13501c106a |
14 | 90b23c10b |
15 | 53367ad06 |
hex | 31caf451f |
13366150431 has 32 divisors (see below), whose sum is σ = 19755912960. Its totient is φ = 7999778304.
The previous prime is 13366150411. The next prime is 13366150463. The reversal of 13366150431 is 13405166331.
It is not a de Polignac number, because 13366150431 - 218 = 13365888287 is a prime.
It is a super-2 number, since 2×133661504312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13366150392 and 13366150401.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13366150411) 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 31 ways as a sum of consecutive naturals, for example, 68316 + ... + 177198.
It is an arithmetic number, because the mean of its divisors is an integer number (617372280).
Almost surely, 213366150431 is an apocalyptic number.
13366150431 is a deficient number, since it is larger than the sum of its proper divisors (6389762529).
13366150431 is a wasteful number, since it uses less digits than its factorization.
13366150431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 109015.
The product of its (nonzero) digits is 19440, while the sum is 33.
The spelling of 13366150431 in words is "thirteen billion, three hundred sixty-six million, one hundred fifty thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •