Base | Representation |
---|---|
bin | 1100000000101100001111… |
… | …0110011101011101001011 |
3 | 1201202111000220122012002112 |
4 | 3000023003312131131023 |
5 | 3212331404404121301 |
6 | 44030432031252535 |
7 | 2532050240643410 |
oct | 300130366353513 |
9 | 51674026565075 |
10 | 13206015301451 |
11 | 42317043a2a05 |
12 | 15934b797a14b |
13 | 74a42529cc5b |
14 | 339262d7a107 |
15 | 17d7bac679bb |
hex | c02c3d9d74b |
13206015301451 has 8 divisors (see below), whose sum is σ = 15188720056800. Its totient is φ = 11247343331328.
The previous prime is 13206015301441. The next prime is 13206015301469. The reversal of 13206015301451 is 15410351060231.
13206015301451 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13206015301451 - 210 = 13206015300427 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13206015301441) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6008195126 + ... + 6008197323.
It is an arithmetic number, because the mean of its divisors is an integer number (1898590007100).
Almost surely, 213206015301451 is an apocalyptic number.
13206015301451 is a deficient number, since it is larger than the sum of its proper divisors (1982704755349).
13206015301451 is a wasteful number, since it uses less digits than its factorization.
13206015301451 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12016392613.
The product of its (nonzero) digits is 10800, while the sum is 32.
Adding to 13206015301451 its reverse (15410351060231), we get a palindrome (28616366361682).
The spelling of 13206015301451 in words is "thirteen trillion, two hundred six billion, fifteen million, three hundred one thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •