Base | Representation |
---|---|
bin | 11101111000000111110100… |
… | …001000010111100101110101 |
3 | 122020020201110001001112212011 |
4 | 131320013310020113211311 |
5 | 114210324230230233023 |
6 | 1143244201322324221 |
7 | 36451224150115126 |
oct | 3570076410274565 |
9 | 566221401045764 |
10 | 131400030321013 |
11 | 38960492585103 |
12 | 128a2258359671 |
13 | 5841c7b54718c |
14 | 2463b1c81c04d |
15 | 102d03a1e750d |
hex | 7781f4217975 |
131400030321013 has 16 divisors (see below), whose sum is σ = 141260469488640. Its totient is φ = 121834121900400.
The previous prime is 131400030320983. The next prime is 131400030321017. The reversal of 131400030321013 is 310123030004131.
It is a cyclic number.
It is not a de Polignac number, because 131400030321013 - 29 = 131400030320501 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131400030321017) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 74326758 + ... + 76074088.
It is an arithmetic number, because the mean of its divisors is an integer number (8828779343040).
Almost surely, 2131400030321013 is an apocalyptic number.
It is an amenable number.
131400030321013 is a deficient number, since it is larger than the sum of its proper divisors (9860439167627).
131400030321013 is a wasteful number, since it uses less digits than its factorization.
131400030321013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1831608.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 131400030321013 its reverse (310123030004131), we get a palindrome (441523060325144).
The spelling of 131400030321013 in words is "one hundred thirty-one trillion, four hundred billion, thirty million, three hundred twenty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •