Base | Representation |
---|---|
bin | 1011110101011010010011… |
… | …0000111100000101000000 |
3 | 1201001221211000000122010200 |
4 | 2331112210300330011000 |
5 | 3201143011334411000 |
6 | 43401421554325200 |
7 | 2512046643016053 |
oct | 275264460740500 |
9 | 51057730018120 |
10 | 13012220232000 |
11 | 41674a7102990 |
12 | 1561a32289800 |
13 | 73507c63c122 |
14 | 32db1adb0a9a |
15 | 17872740b500 |
hex | bd5a4c3c140 |
13012220232000 has 336 divisors, whose sum is σ = 50778418152384. Its totient is φ = 3154477440000.
The previous prime is 13012220231957. The next prime is 13012220232029. The reversal of 13012220232000 is 23202221031.
13012220232000 is a `hidden beast` number, since 1 + 301 + 22 + 20 + 2 + 320 + 0 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
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 47 ways as a sum of consecutive naturals, for example, 7422786 + ... + 9006785.
Almost surely, 213012220232000 is an apocalyptic number.
13012220232000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13012220232000 is an abundant number, since it is smaller than the sum of its proper divisors (37766197920384).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13012220232000 is a wasteful number, since it uses less digits than its factorization.
13012220232000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16429615 (or 16429592 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
Adding to 13012220232000 its reverse (23202221031), we get a palindrome (13035422453031).
The spelling of 13012220232000 in words is "thirteen trillion, twelve billion, two hundred twenty million, two hundred thirty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •