Base | Representation |
---|---|
bin | 11000010000100110… |
… | …01010011111010010 |
3 | 1020121200020000212022 |
4 | 30020103022133102 |
5 | 203133140041224 |
6 | 5552212331442 |
7 | 640515251210 |
oct | 141023123722 |
9 | 36550200768 |
10 | 13024143314 |
11 | 5583875706 |
12 | 2635913b82 |
13 | 12c73a5ca0 |
14 | 8b7a51cb0 |
15 | 51362065e |
hex | 3084ca7d2 |
13024143314 has 32 divisors (see below), whose sum is σ = 24282671616. Its totient is φ = 5101387200.
The previous prime is 13024143311. The next prime is 13024143329. The reversal of 13024143314 is 41334142031.
13024143314 = T337 + T338 + ... + T4275.
It is a happy number.
13024143314 is digitally balanced in base 5, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×130241433142 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (26).
It is not an unprimeable number, because it can be changed into a prime (13024143311) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 335882 + ... + 372645.
It is an arithmetic number, because the mean of its divisors is an integer number (758833488).
Almost surely, 213024143314 is an apocalyptic number.
13024143314 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
13024143314 is a deficient number, since it is larger than the sum of its proper divisors (11258528302).
13024143314 is a wasteful number, since it uses less digits than its factorization.
13024143314 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 708650.
The product of its (nonzero) digits is 3456, while the sum is 26.
Adding to 13024143314 its reverse (41334142031), we get a palindrome (54358285345).
The spelling of 13024143314 in words is "thirteen billion, twenty-four million, one hundred forty-three thousand, three hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •