Base | Representation |
---|---|
bin | 1011111101001010100011… |
… | …0000001010000011010010 |
3 | 1201112200122200210222222011 |
4 | 2333102220300022003102 |
5 | 3210333320331402010 |
6 | 43542532214133134 |
7 | 2524504015631116 |
oct | 277225060120322 |
9 | 51480580728864 |
10 | 13145431122130 |
11 | 4208a4519331a |
12 | 158380a3511aa |
13 | 7447bb7c6238 |
14 | 336356a9b746 |
15 | 17be220bea8a |
hex | bf4a8c0a0d2 |
13145431122130 has 16 divisors (see below), whose sum is σ = 24425059117824. Its totient is φ = 5088553982640.
The previous prime is 13145431122127. The next prime is 13145431122143. The reversal of 13145431122130 is 3122113454131.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a junction number, because it is equal to n+sod(n) for n = 13145431122092 and 13145431122101.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 21202307952 + ... + 21202308571.
It is an arithmetic number, because the mean of its divisors is an integer number (1526566194864).
Almost surely, 213145431122130 is an apocalyptic number.
13145431122130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13145431122130 is a deficient number, since it is larger than the sum of its proper divisors (11279627995694).
13145431122130 is a wasteful number, since it uses less digits than its factorization.
13145431122130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42404616561.
The product of its (nonzero) digits is 8640, while the sum is 31.
Adding to 13145431122130 its reverse (3122113454131), we get a palindrome (16267544576261).
The spelling of 13145431122130 in words is "thirteen trillion, one hundred forty-five billion, four hundred thirty-one million, one hundred twenty-two thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •