Base | Representation |
---|---|
bin | 1100010000010100000000… |
… | …1111110011111011110101 |
3 | 1202201010202102112101200001 |
4 | 3010011000033303323311 |
5 | 3231231022403404021 |
6 | 44354014402551301 |
7 | 2560330644514651 |
oct | 304050017637365 |
9 | 52633672471601 |
10 | 13474390294261 |
11 | 4325503054226 |
12 | 1617516068531 |
13 | 769825186450 |
14 | 348241d0da61 |
15 | 185776d0e091 |
hex | c41403f3ef5 |
13474390294261 has 32 divisors (see below), whose sum is σ = 14975793423360. Its totient is φ = 12045552539904.
The previous prime is 13474390294223. The next prime is 13474390294327. The reversal of 13474390294261 is 16249209347431.
13474390294261 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 13474390294261 - 27 = 13474390294133 is a prime.
It is a super-2 number, since 2×134743902942612 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13474390294661) 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, 218400760 + ... + 218462446.
It is an arithmetic number, because the mean of its divisors is an integer number (467993544480).
Almost surely, 213474390294261 is an apocalyptic number.
It is an amenable number.
13474390294261 is a deficient number, since it is larger than the sum of its proper divisors (1501403129099).
13474390294261 is a wasteful number, since it uses less digits than its factorization.
13474390294261 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 65845.
The product of its (nonzero) digits is 7838208, while the sum is 55.
The spelling of 13474390294261 in words is "thirteen trillion, four hundred seventy-four billion, three hundred ninety million, two hundred ninety-four thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •