Base | Representation |
---|---|
bin | 1100001001010111010011… |
… | …0000100100011100110010 |
3 | 1202021201121202121111122120 |
4 | 3002111310300210130302 |
5 | 3222302031111300110 |
6 | 44223112524215110 |
7 | 2545603436540232 |
oct | 302256460443462 |
9 | 52251552544576 |
10 | 13355012212530 |
11 | 428991325854a |
12 | 15b835a69a496 |
13 | 75b4abaa0271 |
14 | 342559417cc2 |
15 | 1825db755870 |
hex | c2574c24732 |
13355012212530 has 32 divisors (see below), whose sum is σ = 32052414139200. Its totient is φ = 3561293831232.
The previous prime is 13355012212463. The next prime is 13355012212561. The reversal of 13355012212530 is 3521221055331.
It is a junction number, because it is equal to n+sod(n) for n = 13355012212491 and 13355012212500.
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 15 ways as a sum of consecutive naturals, for example, 91240 + ... + 5168979.
It is an arithmetic number, because the mean of its divisors is an integer number (1001637941850).
Almost surely, 213355012212530 is an apocalyptic number.
13355012212530 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13355012212530 is an abundant number, since it is smaller than the sum of its proper divisors (18697401926670).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13355012212530 is a wasteful number, since it uses less digits than its factorization.
13355012212530 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5344858.
The product of its (nonzero) digits is 27000, while the sum is 33.
Adding to 13355012212530 its reverse (3521221055331), we get a palindrome (16876233267861).
The spelling of 13355012212530 in words is "thirteen trillion, three hundred fifty-five billion, twelve million, two hundred twelve thousand, five hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •