Base | Representation |
---|---|
bin | 11000010011001101… |
… | …00011100100101111 |
3 | 1020200012100200002220 |
4 | 30021212203210233 |
5 | 203204234112030 |
6 | 5554313050423 |
7 | 641202130062 |
oct | 141146434457 |
9 | 36605320086 |
10 | 13046004015 |
11 | 5595146a00 |
12 | 26410b6a13 |
13 | 12cba8b305 |
14 | 8ba9028d9 |
15 | 5154dca10 |
hex | 3099a392f |
13046004015 has 24 divisors (see below), whose sum is σ = 22943719344. Its totient is φ = 6325334400.
The previous prime is 13046003981. The next prime is 13046004053. The reversal of 13046004015 is 51040064031.
13046004015 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 13046004015 - 215 = 13045971247 is a prime.
It is a super-2 number, since 2×130460040152 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3592126 + ... + 3595755.
It is an arithmetic number, because the mean of its divisors is an integer number (955988306).
Almost surely, 213046004015 is an apocalyptic number.
13046004015 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
13046004015 is a deficient number, since it is larger than the sum of its proper divisors (9897715329).
13046004015 is a wasteful number, since it uses less digits than its factorization.
13046004015 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7187911 (or 7187900 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 24.
Adding to 13046004015 its reverse (51040064031), we get a palindrome (64086068046).
The spelling of 13046004015 in words is "thirteen billion, forty-six million, four thousand, fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •