Base | Representation |
---|---|
bin | 10101011011111101011… |
… | …001111001101000011101 |
3 | 12012211101222102221010022 |
4 | 111123331121321220131 |
5 | 143113432320144131 |
6 | 3044425141321525 |
7 | 211300353304301 |
oct | 25337531715035 |
9 | 5184358387108 |
10 | 1473130240541 |
11 | 518829686413 |
12 | 1b96044062a5 |
13 | a8bb9706b5b |
14 | 5142ac4bd01 |
15 | 284bd48e37b |
hex | 156fd679a1d |
1473130240541 has 4 divisors (see below), whose sum is σ = 1473156226812. Its totient is φ = 1473104254272.
The previous prime is 1473130240531. The next prime is 1473130240601. The reversal of 1473130240541 is 1450420313741.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1451808108100 + 21322132441 = 1204910^2 + 146021^2 .
It is a cyclic number.
It is not a de Polignac number, because 1473130240541 - 226 = 1473063131677 is a prime.
It is a super-2 number, since 2×14731302405412 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1473130240531) 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, 12907916 + ... + 13021541.
It is an arithmetic number, because the mean of its divisors is an integer number (368289056703).
Almost surely, 21473130240541 is an apocalyptic number.
It is an amenable number.
1473130240541 is a deficient number, since it is larger than the sum of its proper divisors (25986271).
1473130240541 is an equidigital number, since it uses as much as digits as its factorization.
1473130240541 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25986270.
The product of its (nonzero) digits is 40320, while the sum is 35.
The spelling of 1473130240541 in words is "one trillion, four hundred seventy-three billion, one hundred thirty million, two hundred forty thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •