Base | Representation |
---|---|
bin | 111100100011100000… |
… | …0100100101100101011 |
3 | 110102122201212022111222 |
4 | 1321013000210230223 |
5 | 4112310312222111 |
6 | 135423440012255 |
7 | 12252343515206 |
oct | 1710700445453 |
9 | 412581768458 |
10 | 130040351531 |
11 | 5017142a902 |
12 | 2125230108b |
13 | c35536238c |
14 | 64189b093d |
15 | 35b16847db |
hex | 1e47024b2b |
130040351531 has 16 divisors (see below), whose sum is σ = 141982279488. Its totient is φ = 118614912000.
The previous prime is 130040351491. The next prime is 130040351579. The reversal of 130040351531 is 135153040031.
It is a cyclic number.
It is not a de Polignac number, because 130040351531 - 214 = 130040335147 is a prime.
It is a super-2 number, since 2×1300403515312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 130040351531.
It is not an unprimeable number, because it can be changed into a prime (130040851531) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 512540 + ... + 723033.
It is an arithmetic number, because the mean of its divisors is an integer number (8873892468).
Almost surely, 2130040351531 is an apocalyptic number.
130040351531 is a deficient number, since it is larger than the sum of its proper divisors (11941927957).
130040351531 is a wasteful number, since it uses less digits than its factorization.
130040351531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1235782.
The product of its (nonzero) digits is 2700, while the sum is 26.
Adding to 130040351531 its reverse (135153040031), we get a palindrome (265193391562).
The spelling of 130040351531 in words is "one hundred thirty billion, forty million, three hundred fifty-one thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •