Base | Representation |
---|---|
bin | 10011000000101110110… |
… | …000001100000110100001 |
3 | 11121220012001112002200102 |
4 | 103000232300030012201 |
5 | 132401104314124101 |
6 | 2440102112432145 |
7 | 163250105350613 |
oct | 23005660140641 |
9 | 4556161462612 |
10 | 1306454442401 |
11 | 464078523309 |
12 | 191248b48655 |
13 | 96276386c24 |
14 | 47338890db3 |
15 | 23eb58c786b |
hex | 1302ec0c1a1 |
1306454442401 has 8 divisors (see below), whose sum is σ = 1327889903208. Its totient is φ = 1285019568000.
The previous prime is 1306454442383. The next prime is 1306454442443. The reversal of 1306454442401 is 1042444546031.
It can be written as a sum of positive squares in 4 ways, for example, as 43617904801 + 1262836537600 = 208849^2 + 1123760^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1306454442401 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1306454442901) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8368781 + ... + 8523461.
It is an arithmetic number, because the mean of its divisors is an integer number (165986237901).
Almost surely, 21306454442401 is an apocalyptic number.
It is an amenable number.
1306454442401 is a deficient number, since it is larger than the sum of its proper divisors (21435460807).
1306454442401 is a wasteful number, since it uses less digits than its factorization.
1306454442401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 293203.
The product of its (nonzero) digits is 184320, while the sum is 38.
Adding to 1306454442401 its reverse (1042444546031), we get a palindrome (2348898988432).
The spelling of 1306454442401 in words is "one trillion, three hundred six billion, four hundred fifty-four million, four hundred forty-two thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •