Base | Representation |
---|---|
bin | 111101000110011011… |
… | …0011100111100010000 |
3 | 110112200101201110221211 |
4 | 1322030312130330100 |
5 | 4122210244302230 |
6 | 140140014425504 |
7 | 12323362322425 |
oct | 1721466347420 |
9 | 415611643854 |
10 | 131212103440 |
11 | 507128a2410 |
12 | 2151a802294 |
13 | c4b10460c2 |
14 | 64ca469d4c |
15 | 362e49042a |
hex | 1e8cd9cf10 |
131212103440 has 40 divisors (see below), whose sum is σ = 332801610048. Its totient is φ = 47713491840.
The previous prime is 131212103389. The next prime is 131212103447. The reversal of 131212103440 is 44301212131.
It is a tau number, because it is divible by the number of its divisors (40).
It is a Harshad number since it is a multiple of its sum of digits (22).
It is not an unprimeable number, because it can be changed into a prime (131212103447) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 74551452 + ... + 74553211.
Almost surely, 2131212103440 is an apocalyptic number.
131212103440 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
131212103440 is an abundant number, since it is smaller than the sum of its proper divisors (201589506608).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131212103440 is a wasteful number, since it uses less digits than its factorization.
131212103440 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 149104687 (or 149104681 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 131212103440 its reverse (44301212131), we get a palindrome (175513315571).
The spelling of 131212103440 in words is "one hundred thirty-one billion, two hundred twelve million, one hundred three thousand, four hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •