Base | Representation |
---|---|
bin | 1100001101100001101000… |
… | …1001011000101111110010 |
3 | 1202112120011022121100012020 |
4 | 3003120122021120233302 |
5 | 3224434441121414240 |
6 | 44320015113412310 |
7 | 2554014226444254 |
oct | 303303211305762 |
9 | 52476138540166 |
10 | 13426506435570 |
11 | 4307170944498 |
12 | 160a191a0a096 |
13 | 765163966557 |
14 | 345bbc66bcd4 |
15 | 1843c311e0d0 |
hex | c361a258bf2 |
13426506435570 has 64 divisors (see below), whose sum is σ = 34368167102976. Its totient is φ = 3345192826880.
The previous prime is 13426506435541. The next prime is 13426506435577. The reversal of 13426506435570 is 7553460562431.
It is a super-2 number, since 2×134265064355702 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is not an unprimeable number, because it can be changed into a prime (13426506435577) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 96012186 + ... + 96151925.
It is an arithmetic number, because the mean of its divisors is an integer number (537002610984).
Almost surely, 213426506435570 is an apocalyptic number.
13426506435570 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13426506435570 is an abundant number, since it is smaller than the sum of its proper divisors (20941660667406).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13426506435570 is a wasteful number, since it uses less digits than its factorization.
13426506435570 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 192164275.
The product of its (nonzero) digits is 9072000, while the sum is 51.
The spelling of 13426506435570 in words is "thirteen trillion, four hundred twenty-six billion, five hundred six million, four hundred thirty-five thousand, five hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •