Base | Representation |
---|---|
bin | 111101001100000111… |
… | …1011110010011111110 |
3 | 110120011201022210122202 |
4 | 1322120033132103332 |
5 | 4123103210241110 |
6 | 140211002511502 |
7 | 12331202605346 |
oct | 1723017362376 |
9 | 416151283582 |
10 | 131403212030 |
11 | 508007620a2 |
12 | 21572805592 |
13 | c5118092cc |
14 | 65079b5d26 |
15 | 36411400a5 |
hex | 1e983de4fe |
131403212030 has 8 divisors (see below), whose sum is σ = 236525781672. Its totient is φ = 52561284808.
The previous prime is 131403212029. The next prime is 131403212071. The reversal of 131403212030 is 30212304131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1314032120302 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 131403211993 and 131403212011.
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 3 ways as a sum of consecutive naturals, for example, 6570160592 + ... + 6570160611.
It is an arithmetic number, because the mean of its divisors is an integer number (29565722709).
Almost surely, 2131403212030 is an apocalyptic number.
131403212030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
131403212030 is a deficient number, since it is larger than the sum of its proper divisors (105122569642).
131403212030 is a wasteful number, since it uses less digits than its factorization.
131403212030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13140321210.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 131403212030 its reverse (30212304131), we get a palindrome (161615516161).
The spelling of 131403212030 in words is "one hundred thirty-one billion, four hundred three million, two hundred twelve thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •