Base | Representation |
---|---|
bin | 10011010100001000001011… |
… | …10101001001001011111001 |
3 | 12120101101022110001111222001 |
4 | 21222010011311021023321 |
5 | 21031334231012014411 |
6 | 230155501303101001 |
7 | 11642401156135201 |
oct | 1152040565111371 |
9 | 176341273044861 |
10 | 42473029407481 |
11 | 1259578a915a72 |
12 | 491b683741761 |
13 | 1a912603c43ca |
14 | a6b9c4203401 |
15 | 4d9c4ab55dc1 |
hex | 26a105d492f9 |
42473029407481 has 4 divisors (see below), whose sum is σ = 43010662691200. Its totient is φ = 41935396123764.
The previous prime is 42473029407433. The next prime is 42473029407491. The reversal of 42473029407481 is 18470492037424.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 42473029407481 - 219 = 42473028883193 is a prime.
It is a super-2 number, since 2×424730294074812 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (42473029407421) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 268816641741 + ... + 268816641898.
It is an arithmetic number, because the mean of its divisors is an integer number (10752665672800).
Almost surely, 242473029407481 is an apocalyptic number.
It is an amenable number.
42473029407481 is a deficient number, since it is larger than the sum of its proper divisors (537633283719).
42473029407481 is an equidigital number, since it uses as much as digits as its factorization.
42473029407481 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 537633283718.
The product of its (nonzero) digits is 10838016, while the sum is 55.
The spelling of 42473029407481 in words is "forty-two trillion, four hundred seventy-three billion, twenty-nine million, four hundred seven thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •