Base | Representation |
---|---|
bin | 10101011100001101100… |
… | …100000101101001110000 |
3 | 12012212002212120112211010 |
4 | 111130031210011221300 |
5 | 143120011221043142 |
6 | 3044512104150520 |
7 | 211310154543213 |
oct | 25341544055160 |
9 | 5185085515733 |
10 | 1473401346672 |
11 | 518958715472 |
12 | 1b967b168440 |
13 | a8c30929298 |
14 | 51454c5d77a |
15 | 284d7191e9c |
hex | 1570d905a70 |
1473401346672 has 20 divisors (see below), whose sum is σ = 3806286812360. Its totient is φ = 491133782208.
The previous prime is 1473401346647. The next prime is 1473401346749. The reversal of 1473401346672 is 2766431043741.
It is a Harshad number since it is a multiple of its sum of digits (48), and also a Moran number because the ratio is a prime number: 30695861389 = 1473401346672 / (1 + 4 + 7 + 3 + 4 + 0 + 1 + 3 + 4 + 6 + 6 + 7 + 2).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 15347930647 + ... + 15347930742.
It is an arithmetic number, because the mean of its divisors is an integer number (190314340618).
Almost surely, 21473401346672 is an apocalyptic number.
1473401346672 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1473401346672 is an abundant number, since it is smaller than the sum of its proper divisors (2332885465688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1473401346672 is a wasteful number, since it uses less digits than its factorization.
1473401346672 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30695861400 (or 30695861394 counting only the distinct ones).
The product of its (nonzero) digits is 2032128, while the sum is 48.
The spelling of 1473401346672 in words is "one trillion, four hundred seventy-three billion, four hundred one million, three hundred forty-six thousand, six hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •