Base | Representation |
---|---|
bin | 1011111100100000110101… |
… | …0011100100001110101110 |
3 | 1201111121202021222211200110 |
4 | 2333020031103210032232 |
5 | 3210142402201132420 |
6 | 43533441120240450 |
7 | 2523626354234115 |
oct | 277101523441656 |
9 | 51447667884613 |
10 | 13134233224110 |
11 | 4204219278849 |
12 | 1581604170126 |
13 | 74372589c28b |
14 | 3359b37d4c7c |
15 | 17b9b8e8dee0 |
hex | bf20d4e43ae |
13134233224110 has 64 divisors (see below), whose sum is σ = 32270346630720. Its totient is φ = 3420280396800.
The previous prime is 13134233224039. The next prime is 13134233224129. The reversal of 13134233224110 is 1142233243131.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 29468745 + ... + 29911124.
It is an arithmetic number, because the mean of its divisors is an integer number (504224166105).
Almost surely, 213134233224110 is an apocalyptic number.
13134233224110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13134233224110 is an abundant number, since it is smaller than the sum of its proper divisors (19136113406610).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13134233224110 is a wasteful number, since it uses less digits than its factorization.
13134233224110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59380053.
The product of its (nonzero) digits is 10368, while the sum is 30.
Adding to 13134233224110 its reverse (1142233243131), we get a palindrome (14276466467241).
The spelling of 13134233224110 in words is "thirteen trillion, one hundred thirty-four billion, two hundred thirty-three million, two hundred twenty-four thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.116 sec. • engine limits •