Base | Representation |
---|---|
bin | 111101101001111000001011… |
… | …1101001110010111000010001 |
3 | 2122010012000210222202210210122 |
4 | 1323103300113221302320101 |
5 | 1032040311341301113401 |
6 | 5201225050225440025 |
7 | 222142063634561156 |
oct | 17323602751627021 |
9 | 2563160728683718 |
10 | 542317327363601 |
11 | 14788753a127729 |
12 | 509a88937a0015 |
13 | 1a37b3c60a358a |
14 | 97cc4278a022d |
15 | 42a6db909521b |
hex | 1ed3c17a72e11 |
542317327363601 has 8 divisors (see below), whose sum is σ = 550164321305280. Its totient is φ = 534521789120368.
The previous prime is 542317327363589. The next prime is 542317327363657. The reversal of 542317327363601 is 106363723713245.
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-542317327363601 is a prime.
It is a super-2 number, since 2×5423173273636012 (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 (542317327393601) 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, 12863903381 + ... + 12863945538.
It is an arithmetic number, because the mean of its divisors is an integer number (68770540163160).
Almost surely, 2542317327363601 is an apocalyptic number.
It is an amenable number.
542317327363601 is a deficient number, since it is larger than the sum of its proper divisors (7846993941679).
542317327363601 is a wasteful number, since it uses less digits than its factorization.
542317327363601 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 25727849223.
The product of its (nonzero) digits is 11430720, while the sum is 53.
The spelling of 542317327363601 in words is "five hundred forty-two trillion, three hundred seventeen billion, three hundred twenty-seven million, three hundred sixty-three thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •