Base | Representation |
---|---|
bin | 10101011101010001100… |
… | …001001001100010100010 |
3 | 12012222001022211121210220 |
4 | 111131101201021202202 |
5 | 143124330101124400 |
6 | 3045221152103510 |
7 | 211350340220142 |
oct | 25352141114242 |
9 | 5188038747726 |
10 | 1474541426850 |
11 | 519393215598 |
12 | 1b9938b34b96 |
13 | a9082ba113b |
14 | 51522432922 |
15 | 285522e37a0 |
hex | 157518498a2 |
1474541426850 has 24 divisors (see below), whose sum is σ = 3656862738960. Its totient is φ = 393211047120.
The previous prime is 1474541426843. The next prime is 1474541426851. The reversal of 1474541426850 is 586241454741.
It is a junction number, because it is equal to n+sod(n) for n = 1474541426793 and 1474541426802.
It is not an unprimeable number, because it can be changed into a prime (1474541426851) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 4915137940 + ... + 4915138239.
It is an arithmetic number, because the mean of its divisors is an integer number (152369280790).
Almost surely, 21474541426850 is an apocalyptic number.
1474541426850 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1474541426850 is an abundant number, since it is smaller than the sum of its proper divisors (2182321312110).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1474541426850 is a wasteful number, since it uses less digits than its factorization.
1474541426850 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9830276194 (or 9830276189 counting only the distinct ones).
The product of its (nonzero) digits is 4300800, while the sum is 51.
The spelling of 1474541426850 in words is "one trillion, four hundred seventy-four billion, five hundred forty-one million, four hundred twenty-six thousand, eight hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.154 sec. • engine limits •