Base | Representation |
---|---|
bin | 100011111101110101010001… |
… | …1100100001000000111011001 |
3 | 1112111010212012001201022001111 |
4 | 1013323222203210020013121 |
5 | 312431231214440323101 |
6 | 3040502235214220321 |
7 | 123431234350424323 |
oct | 10773524344100731 |
9 | 1474125161638044 |
10 | 316361445245401 |
11 | 91891154351536 |
12 | 2b594b73ab46a1 |
13 | 1076a9aa7098aa |
14 | 5819d93278613 |
15 | 268944947c251 |
hex | 11fbaa39081d9 |
316361445245401 has 8 divisors (see below), whose sum is σ = 321255790635584. Its totient is φ = 311472174348720.
The previous prime is 316361445245359. The next prime is 316361445245407. The reversal of 316361445245401 is 104542544163613.
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 316361445245401 - 231 = 316359297761753 is a prime.
It is a super-2 number, since 2×3163614452454012 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (316361445245407) 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, 1268497725 + ... + 1268747098.
It is an arithmetic number, because the mean of its divisors is an integer number (40156973829448).
Almost surely, 2316361445245401 is an apocalyptic number.
It is an amenable number.
316361445245401 is a deficient number, since it is larger than the sum of its proper divisors (4894345390183).
316361445245401 is a wasteful number, since it uses less digits than its factorization.
316361445245401 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2537246751.
The product of its (nonzero) digits is 4147200, while the sum is 49.
The spelling of 316361445245401 in words is "three hundred sixteen trillion, three hundred sixty-one billion, four hundred forty-five million, two hundred forty-five thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •