Base | Representation |
---|---|
bin | 11000111101100010… |
… | …01000111011111111 |
3 | 1021120221112102021012 |
4 | 30132301020323333 |
5 | 204421140200111 |
6 | 10053440025435 |
7 | 653043320324 |
oct | 143661107377 |
9 | 37527472235 |
10 | 13401100031 |
11 | 5757631890 |
12 | 272000227b |
13 | 1357509bb7 |
14 | 911b38b4b |
15 | 53678148b |
hex | 31ec48eff |
13401100031 has 8 divisors (see below), whose sum is σ = 14626405200. Its totient is φ = 12176965440.
The previous prime is 13401100021. The next prime is 13401100033. The reversal of 13401100031 is 13000110431.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13401100031 is a prime.
It is a super-2 number, since 2×134011000312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13401099979 and 13401100015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13401100033) 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, 268616 + ... + 314573.
It is an arithmetic number, because the mean of its divisors is an integer number (1828300650).
Almost surely, 213401100031 is an apocalyptic number.
13401100031 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
13401100031 is a deficient number, since it is larger than the sum of its proper divisors (1225305169).
13401100031 is a wasteful number, since it uses less digits than its factorization.
13401100031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 585289.
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 13401100031 its reverse (13000110431), we get a palindrome (26401210462).
The spelling of 13401100031 in words is "thirteen billion, four hundred one million, one hundred thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •