Base | Representation |
---|---|
bin | 111100101111100010… |
… | …0110011100111100001 |
3 | 110110200212121121001100 |
4 | 1321133010303213201 |
5 | 4114122143130101 |
6 | 135531502025013 |
7 | 12265345451346 |
oct | 1713704634741 |
9 | 413625547040 |
10 | 130444114401 |
11 | 50359335927 |
12 | 21345578169 |
13 | c3babc0613 |
14 | 64564747cd |
15 | 35d6d3ce86 |
hex | 1e5f1339e1 |
130444114401 has 12 divisors (see below), whose sum is σ = 188634133012. Its totient is φ = 86863578336.
The previous prime is 130444114399. The next prime is 130444114403. The reversal of 130444114401 is 104411444031.
It is an interprime number because it is at equal distance from previous prime (130444114399) and next prime (130444114403).
It can be written as a sum of positive squares in 2 ways, for example, as 121846374225 + 8597740176 = 349065^2 + 92724^2 .
It is not a de Polignac number, because 130444114401 - 21 = 130444114399 is a prime.
It is a super-2 number, since 2×1304441144012 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (130444114403) 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, 8255386 + ... + 8271171.
Almost surely, 2130444114401 is an apocalyptic number.
It is an amenable number.
130444114401 is a deficient number, since it is larger than the sum of its proper divisors (58190018611).
130444114401 is a wasteful number, since it uses less digits than its factorization.
130444114401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16527440 (or 16527437 counting only the distinct ones).
The product of its (nonzero) digits is 3072, while the sum is 27.
Adding to 130444114401 its reverse (104411444031), we get a palindrome (234855558432).
The spelling of 130444114401 in words is "one hundred thirty billion, four hundred forty-four million, one hundred fourteen thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •