Base | Representation |
---|---|
bin | 11000011110110001… |
… | …11100101110101010 |
3 | 1020220222001200012201 |
4 | 30033120330232222 |
5 | 203404113202310 |
6 | 10012102130414 |
7 | 643461336523 |
oct | 141730745652 |
9 | 36828050181 |
10 | 13143100330 |
11 | 5634a34898 |
12 | 2669720a0a |
13 | 1315c26259 |
14 | 8c977984a |
15 | 51dcbbe3a |
hex | 30f63cbaa |
13143100330 has 8 divisors (see below), whose sum is σ = 23657580612. Its totient is φ = 5257240128.
The previous prime is 13143100309. The next prime is 13143100331. The reversal of 13143100330 is 3300134131.
It can be written as a sum of positive squares in 2 ways, for example, as 10660769001 + 2482331329 = 103251^2 + 49823^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×131431003302 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13143100298 and 13143100307.
It is not an unprimeable number, because it can be changed into a prime (13143100331) 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, 657155007 + ... + 657155026.
Almost surely, 213143100330 is an apocalyptic number.
13143100330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13143100330 is a deficient number, since it is larger than the sum of its proper divisors (10514480282).
13143100330 is a wasteful number, since it uses less digits than its factorization.
13143100330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1314310040.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 13143100330 its reverse (3300134131), we get a palindrome (16443234461).
The spelling of 13143100330 in words is "thirteen billion, one hundred forty-three million, one hundred thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •