Base | Representation |
---|---|
bin | 1011111011010101111110… |
… | …1011001110101000011100 |
3 | 1201102200212222122200011010 |
4 | 2332311133223032220130 |
5 | 3204330224410303312 |
6 | 43520315231455220 |
7 | 2522315423340420 |
oct | 276653753165034 |
9 | 51380788580133 |
10 | 13114140322332 |
11 | 41a67483662a5 |
12 | 1579737087510 |
13 | 741872b9799a |
14 | 334a29048b80 |
15 | 17b1deec193c |
hex | bed5facea1c |
13114140322332 has 96 divisors (see below), whose sum is σ = 35141950771200. Its totient is φ = 3728629988352.
The previous prime is 13114140322313. The next prime is 13114140322343. The reversal of 13114140322332 is 23322304141131.
It is a self number, because there is not a number n which added to its sum of digits gives 13114140322332.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 13685269 + ... + 14612147.
It is an arithmetic number, because the mean of its divisors is an integer number (366061987200).
Almost surely, 213114140322332 is an apocalyptic number.
13114140322332 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
13114140322332 is an abundant number, since it is smaller than the sum of its proper divisors (22027810448868).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13114140322332 is a wasteful number, since it uses less digits than its factorization.
13114140322332 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 927715 (or 927713 counting only the distinct ones).
The product of its (nonzero) digits is 10368, while the sum is 30.
Adding to 13114140322332 its reverse (23322304141131), we get a palindrome (36436444463463).
The spelling of 13114140322332 in words is "thirteen trillion, one hundred fourteen billion, one hundred forty million, three hundred twenty-two thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •