Base | Representation |
---|---|
bin | 1100000111100100101001… |
… | …0000010101110111001110 |
3 | 1202011210011210122002112020 |
4 | 3001321022100111313032 |
5 | 3221301012443200110 |
6 | 44201022503551010 |
7 | 2543433643165542 |
oct | 301711220256716 |
9 | 52153153562466 |
10 | 13324234350030 |
11 | 4277859a2394a |
12 | 15b23ab15b466 |
13 | 7586155065c6 |
14 | 340c79967a22 |
15 | 1818d96c8d70 |
hex | c1e4a415dce |
13324234350030 has 32 divisors (see below), whose sum is σ = 31978260787104. Its totient is φ = 3553118232576.
The previous prime is 13324234349953. The next prime is 13324234350073. The reversal of 13324234350030 is 3005343242331.
It is a super-2 number, since 2×133242343500302 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13324234349973 and 13324234350000.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 15592842 + ... + 16425138.
It is an arithmetic number, because the mean of its divisors is an integer number (999320649597).
Almost surely, 213324234350030 is an apocalyptic number.
13324234350030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13324234350030 is an abundant number, since it is smaller than the sum of its proper divisors (18654026437074).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13324234350030 is a wasteful number, since it uses less digits than its factorization.
13324234350030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1365940.
The product of its (nonzero) digits is 77760, while the sum is 33.
Adding to 13324234350030 its reverse (3005343242331), we get a palindrome (16329577592361).
The spelling of 13324234350030 in words is "thirteen trillion, three hundred twenty-four billion, two hundred thirty-four million, three hundred fifty thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.118 sec. • engine limits •