Base | Representation |
---|---|
bin | 10101011101001001011… |
… | …111010111010001011101 |
3 | 12012221200221101212200020 |
4 | 111131021133113101131 |
5 | 143124041111203320 |
6 | 3045155541222353 |
7 | 211344113342235 |
oct | 25351137272135 |
9 | 5187627355606 |
10 | 1474406741085 |
11 | 519324193143 |
12 | 1b98bba019b9 |
13 | a9061004915 |
14 | 5150c5b2cc5 |
15 | 2854558b940 |
hex | 157497d745d |
1474406741085 has 8 divisors (see below), whose sum is σ = 2359050785760. Its totient is φ = 786350261904.
The previous prime is 1474406741081. The next prime is 1474406741089. The reversal of 1474406741085 is 5801476044741.
It is an interprime number because it is at equal distance from previous prime (1474406741081) and next prime (1474406741089).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1474406741085 - 22 = 1474406741081 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1474406741081) 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, 49146891355 + ... + 49146891384.
It is an arithmetic number, because the mean of its divisors is an integer number (294881348220).
Almost surely, 21474406741085 is an apocalyptic number.
1474406741085 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1474406741085 is a deficient number, since it is larger than the sum of its proper divisors (884644044675).
1474406741085 is an equidigital number, since it uses as much as digits as its factorization.
1474406741085 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 98293782747.
The product of its (nonzero) digits is 3010560, while the sum is 51.
The spelling of 1474406741085 in words is "one trillion, four hundred seventy-four billion, four hundred six million, seven hundred forty-one thousand, eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •