Base | Representation |
---|---|
bin | 11000101001100111… |
… | …01101000101001000 |
3 | 1021011022002212101120 |
4 | 30110303231011020 |
5 | 204100401001300 |
6 | 10025110315240 |
7 | 645644100651 |
oct | 142463550510 |
9 | 37138085346 |
10 | 13234000200 |
11 | 5681280253 |
12 | 2694058b20 |
13 | 132ba01965 |
14 | 8d787c528 |
15 | 526c753a0 |
hex | 314ced148 |
13234000200 has 96 divisors (see below), whose sum is σ = 43438692960. Its totient is φ = 3321472000.
The previous prime is 13234000181. The next prime is 13234000237. The reversal of 13234000200 is 200043231.
It is a super-2 number, since 2×132340002002 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 13234000200.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 638526 + ... + 658925.
It is an arithmetic number, because the mean of its divisors is an integer number (452486385).
Almost surely, 213234000200 is an apocalyptic number.
13234000200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13234000200 is an abundant number, since it is smaller than the sum of its proper divisors (30204692760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13234000200 is a wasteful number, since it uses less digits than its factorization.
13234000200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1297487 (or 1297478 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 15.
Adding to 13234000200 its reverse (200043231), we get a palindrome (13434043431).
The spelling of 13234000200 in words is "thirteen billion, two hundred thirty-four million, two hundred", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •