Base | Representation |
---|---|
bin | 11000001111010001… |
… | …01001111101101011 |
3 | 1020120220020220011120 |
4 | 30013220221331223 |
5 | 203122312000133 |
6 | 5551133430323 |
7 | 640321450431 |
oct | 140750517553 |
9 | 36526226146 |
10 | 13013000043 |
11 | 557855459a |
12 | 263203b3a3 |
13 | 12c4ca3c34 |
14 | 8b6390d51 |
15 | 51266dab3 |
hex | 307a29f6b |
13013000043 has 4 divisors (see below), whose sum is σ = 17350666728. Its totient is φ = 8675333360.
The previous prime is 13012999999. The next prime is 13013000101. The reversal of 13013000043 is 34000031031.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 13013000043 - 28 = 13012999787 is a prime.
It is a super-3 number, since 3×130130000433 (a number of 31 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13012999986 and 13013000031.
It is not an unprimeable number, because it can be changed into a prime (13013040043) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2168833338 + ... + 2168833343.
It is an arithmetic number, because the mean of its divisors is an integer number (4337666682).
Almost surely, 213013000043 is an apocalyptic number.
13013000043 is a deficient number, since it is larger than the sum of its proper divisors (4337666685).
13013000043 is an equidigital number, since it uses as much as digits as its factorization.
13013000043 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4337666684.
The product of its (nonzero) digits is 108, while the sum is 15.
Adding to 13013000043 its reverse (34000031031), we get a palindrome (47013031074).
The spelling of 13013000043 in words is "thirteen billion, thirteen million, forty-three", and thus it is an aban number and an uban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •