Base | Representation |
---|---|
bin | 11000010001011010… |
… | …11011000011010100 |
3 | 1020122011011202100221 |
4 | 30020231123003110 |
5 | 203141420330100 |
6 | 5553020044124 |
7 | 640630621033 |
oct | 141055330324 |
9 | 36564152327 |
10 | 13031026900 |
11 | 5587747421 |
12 | 2638093644 |
13 | 12c8946208 |
14 | 8b892471a |
15 | 51403001a |
hex | 308b5b0d4 |
13031026900 has 18 divisors (see below), whose sum is σ = 28277328590. Its totient is φ = 5212410720.
The previous prime is 13031026873. The next prime is 13031026909. The reversal of 13031026900 is 962013031.
It can be written as a sum of positive squares in 3 ways, for example, as 2636000964 + 10395025936 = 51342^2 + 101956^2 .
It is a super-2 number, since 2×130310269002 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13031026909) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 65155035 + ... + 65155234.
Almost surely, 213031026900 is an apocalyptic number.
13031026900 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13031026900 is an abundant number, since it is smaller than the sum of its proper divisors (15246301690).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13031026900 is a wasteful number, since it uses less digits than its factorization.
13031026900 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 130310283 (or 130310276 counting only the distinct ones).
The product of its (nonzero) digits is 972, while the sum is 25.
Adding to 13031026900 its reverse (962013031), we get a palindrome (13993039931).
The spelling of 13031026900 in words is "thirteen billion, thirty-one million, twenty-six thousand, nine hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.197 sec. • engine limits •