Base | Representation |
---|---|
bin | 1011110111001110001100… |
… | …0101000101100001000000 |
3 | 1201011221010010102120110210 |
4 | 2331303203011011201000 |
5 | 3202200220100101000 |
6 | 43424005010554120 |
7 | 2514230613500163 |
oct | 275634305054100 |
9 | 51157103376423 |
10 | 13043330472000 |
11 | 4179711015734 |
12 | 1567a74b98940 |
13 | 737c99a2ba6a |
14 | 33142ca61ada |
15 | 179448740350 |
hex | bdce3145840 |
13043330472000 has 448 divisors, whose sum is σ = 43598673930240. Its totient is φ = 3435713280000.
The previous prime is 13043330471989. The next prime is 13043330472037. The reversal of 13043330472000 is 27403334031.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 648685947 + ... + 648706053.
Almost surely, 213043330472000 is an apocalyptic number.
13043330472000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 13043330472000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (21799336965120).
13043330472000 is an abundant number, since it is smaller than the sum of its proper divisors (30555343458240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13043330472000 is a wasteful number, since it uses less digits than its factorization.
13043330472000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20467 (or 20447 counting only the distinct ones).
The product of its (nonzero) digits is 18144, while the sum is 30.
The spelling of 13043330472000 in words is "thirteen trillion, forty-three billion, three hundred thirty million, four hundred seventy-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •