Base | Representation |
---|---|
bin | 11101101010001001101110… |
… | …100010000110100011001001 |
3 | 122002211221110122201212121110 |
4 | 131222021232202012203021 |
5 | 114044112120332304001 |
6 | 1141231151445200533 |
7 | 36321660035254320 |
oct | 3552115642064311 |
9 | 562757418655543 |
10 | 130440011213001 |
11 | 38620330847106 |
12 | 12768193a00149 |
13 | 57a25953a0799 |
14 | 242d48a20b0b7 |
15 | 101309d9413d6 |
hex | 76a26e8868c9 |
130440011213001 has 32 divisors (see below), whose sum is σ = 198994969036800. Its totient is φ = 74451189511296.
The previous prime is 130440011212967. The next prime is 130440011213009. The reversal of 130440011213001 is 100312110044031.
It is not a de Polignac number, because 130440011213001 - 27 = 130440011212873 is a prime.
It is a super-3 number, since 3×1304400112130013 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is not an unprimeable number, because it can be changed into a prime (130440011213009) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1040236630 + ... + 1040362016.
It is an arithmetic number, because the mean of its divisors is an integer number (6218592782400).
Almost surely, 2130440011213001 is an apocalyptic number.
It is an amenable number.
130440011213001 is a deficient number, since it is larger than the sum of its proper divisors (68554957823799).
130440011213001 is a wasteful number, since it uses less digits than its factorization.
130440011213001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 182133.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 130440011213001 its reverse (100312110044031), we get a palindrome (230752121257032).
The spelling of 130440011213001 in words is "one hundred thirty trillion, four hundred forty billion, eleven million, two hundred thirteen thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •