Base | Representation |
---|---|
bin | 100011100110011010001101… |
… | …0111011101101011101110001 |
3 | 1112001202002210220001212110101 |
4 | 1013030310122323231131301 |
5 | 312021010232421210101 |
6 | 3025555315005232401 |
7 | 122646531122206510 |
oct | 10714643273553561 |
9 | 1461662726055411 |
10 | 313142222444401 |
11 | 9085a963a72769 |
12 | 2b155088862701 |
13 | 1059625321177c |
14 | 57482432ca677 |
15 | 2630833db9401 |
hex | 11ccd1aeed771 |
313142222444401 has 8 divisors (see below), whose sum is σ = 357883205251904. Its totient is φ = 268402834537200.
The previous prime is 313142222444369. The next prime is 313142222444417. The reversal of 313142222444401 is 104444222241313.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 313142222444401 - 25 = 313142222444369 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (313142222444431) 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, 398304315 + ... + 399089728.
It is an arithmetic number, because the mean of its divisors is an integer number (44735400656488).
Almost surely, 2313142222444401 is an apocalyptic number.
It is an amenable number.
313142222444401 is a deficient number, since it is larger than the sum of its proper divisors (44740982807503).
313142222444401 is an equidigital number, since it uses as much as digits as its factorization.
313142222444401 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 797450151.
The product of its (nonzero) digits is 147456, while the sum is 37.
Adding to 313142222444401 its reverse (104444222241313), we get a palindrome (417586444685714).
The spelling of 313142222444401 in words is "three hundred thirteen trillion, one hundred forty-two billion, two hundred twenty-two million, four hundred forty-four thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •