Base | Representation |
---|---|
bin | 11101101010001001101111… |
… | …010011010100001101010001 |
3 | 122002211221111120000022110021 |
4 | 131222021233103110031101 |
5 | 114044112132133122001 |
6 | 1141231153025503441 |
7 | 36321660253025500 |
oct | 3552115723241521 |
9 | 562757446008407 |
10 | 130440024114001 |
11 | 38620338058898 |
12 | 127681981a1b81 |
13 | 57a2597c69904 |
14 | 242d48bc08837 |
15 | 101309eb3dba1 |
hex | 76a26f4d4351 |
130440024114001 has 12 divisors (see below), whose sum is σ = 154308157205040. Its totient is φ = 109910722495560.
The previous prime is 130440024113947. The next prime is 130440024114017. The reversal of 130440024114001 is 100411420044031.
It is not a de Polignac number, because 130440024114001 - 27 = 130440024113873 is a prime.
It is a super-2 number, since 2×1304400241140012 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (130440004114001) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 22559669215 + ... + 22559674996.
It is an arithmetic number, because the mean of its divisors is an integer number (12859013100420).
Almost surely, 2130440024114001 is an apocalyptic number.
It is an amenable number.
130440024114001 is a deficient number, since it is larger than the sum of its proper divisors (23868133091039).
130440024114001 is an equidigital number, since it uses as much as digits as its factorization.
130440024114001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 45119344284 (or 45119344277 counting only the distinct ones).
The product of its (nonzero) digits is 1536, while the sum is 25.
Adding to 130440024114001 its reverse (100411420044031), we get a palindrome (230851444158032).
The spelling of 130440024114001 in words is "one hundred thirty trillion, four hundred forty billion, twenty-four million, one hundred fourteen thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •