Base | Representation |
---|---|
bin | 1011111100111010111001… |
… | …0111000111000100011000 |
3 | 1201112021210221010200221010 |
4 | 2333032232113013010120 |
5 | 3210301214421033222 |
6 | 43540555311013520 |
7 | 2524264636055211 |
oct | 277165627070430 |
9 | 51467727120833 |
10 | 13141230252312 |
11 | 4207189982688 |
12 | 1582a3750a2a0 |
13 | 74429c3a4656 |
14 | 336078bba408 |
15 | 17bc783bc80c |
hex | bf3ae5c7118 |
13141230252312 has 32 divisors (see below), whose sum is σ = 33654370160880. Its totient is φ = 4273570813440.
The previous prime is 13141230252299. The next prime is 13141230252347. The reversal of 13141230252312 is 21325203214131.
It is a super-2 number, since 2×131412302523122 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 13141230252312.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6677453413 + ... + 6677455380.
Almost surely, 213141230252312 is an apocalyptic number.
13141230252312 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
13141230252312 is an abundant number, since it is smaller than the sum of its proper divisors (20513139908568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13141230252312 is a wasteful number, since it uses less digits than its factorization.
13141230252312 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13354908843 (or 13354908839 counting only the distinct ones).
The product of its (nonzero) digits is 8640, while the sum is 30.
Adding to 13141230252312 its reverse (21325203214131), we get a palindrome (34466433466443).
The spelling of 13141230252312 in words is "thirteen trillion, one hundred forty-one billion, two hundred thirty million, two hundred fifty-two thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •