Base | Representation |
---|---|
bin | 1100011000011000011010… |
… | …1011110101111001000100 |
3 | 1210012101120010211220121221 |
4 | 3012012012223311321010 |
5 | 3241013421304012100 |
6 | 44541421513450124 |
7 | 2603336050212553 |
oct | 306060653657104 |
9 | 53171503756557 |
10 | 13613011000900 |
11 | 43792779018a3 |
12 | 163a361a10944 |
13 | 77991706990c |
14 | 350c32299d9a |
15 | 18918b8cb01a |
hex | c6186af5e44 |
13613011000900 has 36 divisors (see below), whose sum is σ = 29547753236820. Its totient is φ = 5443818342400.
The previous prime is 13613011000877. The next prime is 13613011000921. The reversal of 13613011000900 is 900011031631.
It is a happy number.
It can be written as a sum of positive squares in 6 ways, for example, as 2570256652804 + 11042754348096 = 1603202^2 + 3323064^2 .
It is a Harshad number since it is a multiple of its sum of digits (25).
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 16930861 + ... + 17716660.
It is an arithmetic number, because the mean of its divisors is an integer number (820770923245).
Almost surely, 213613011000900 is an apocalyptic number.
13613011000900 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13613011000900 is an abundant number, since it is smaller than the sum of its proper divisors (15934742235920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13613011000900 is a wasteful number, since it uses less digits than its factorization.
13613011000900 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34651464 (or 34651457 counting only the distinct ones).
The product of its (nonzero) digits is 486, while the sum is 25.
The spelling of 13613011000900 in words is "thirteen trillion, six hundred thirteen billion, eleven million, nine hundred", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •