Base | Representation |
---|---|
bin | 11101100110101011001010… |
… | …011010000001101101101101 |
3 | 122002000002121221202112022010 |
4 | 131212223022122001231231 |
5 | 114031203204303300331 |
6 | 1140525310211311433 |
7 | 36265500003162336 |
oct | 3546531232015555 |
9 | 562002557675263 |
10 | 130201034431341 |
11 | 38538a48669a65 |
12 | 127299babab579 |
13 | 5785b9bca84c3 |
14 | 2421a997d128d |
15 | 100bc63750e46 |
hex | 766aca681b6d |
130201034431341 has 48 divisors (see below), whose sum is σ = 178292737123776. Its totient is φ = 84470746472448.
The previous prime is 130201034431313. The next prime is 130201034431367. The reversal of 130201034431341 is 143134430102031.
It is not a de Polignac number, because 130201034431341 - 27 = 130201034431213 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 130201034431299 and 130201034431308.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130201034431241) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 25267033021 + ... + 25267038173.
It is an arithmetic number, because the mean of its divisors is an integer number (3714432023412).
Almost surely, 2130201034431341 is an apocalyptic number.
It is an amenable number.
130201034431341 is a deficient number, since it is larger than the sum of its proper divisors (48091702692435).
130201034431341 is an frugal number, since it uses more digits than its factorization.
130201034431341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6942 (or 6349 counting only the distinct ones).
The product of its (nonzero) digits is 10368, while the sum is 30.
Adding to 130201034431341 its reverse (143134430102031), we get a palindrome (273335464533372).
The spelling of 130201034431341 in words is "one hundred thirty trillion, two hundred one billion, thirty-four million, four hundred thirty-one thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •