Base | Representation |
---|---|
bin | 1100000011100000101111… |
… | …1111111111111111010000 |
3 | 1201221010002211110100002012 |
4 | 3000320023333333333100 |
5 | 3214130123410331000 |
6 | 44105004124242052 |
7 | 2535414063336212 |
oct | 300701377777720 |
9 | 51833084410065 |
10 | 13254470402000 |
11 | 4250209aa9153 |
12 | 15a097b3a0328 |
13 | 751b77c59a99 |
14 | 33b73c43a5b2 |
15 | 17eba4b94735 |
hex | c0e0bffffd0 |
13254470402000 has 40 divisors (see below), whose sum is σ = 32049309436872. Its totient is φ = 5301788160000.
The previous prime is 13254470401981. The next prime is 13254470402029. The reversal of 13254470402000 is 20407445231.
It can be written as a sum of positive squares in 4 ways, for example, as 2207993908624 + 11046476493376 = 1485932^2 + 3323624^2 .
It is a tau number, because it is divible by the number of its divisors (40).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3313615601 + ... + 3313619600.
Almost surely, 213254470402000 is an apocalyptic number.
13254470402000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13254470402000 is an abundant number, since it is smaller than the sum of its proper divisors (18794839034872).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13254470402000 is an equidigital number, since it uses as much as digits as its factorization.
13254470402000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6627235224 (or 6627235208 counting only the distinct ones).
The product of its (nonzero) digits is 26880, while the sum is 32.
Adding to 13254470402000 its reverse (20407445231), we get a palindrome (13274877847231).
The spelling of 13254470402000 in words is "thirteen trillion, two hundred fifty-four billion, four hundred seventy million, four hundred two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •