Base | Representation |
---|---|
bin | 111100101111101111… |
… | …1111111110101100111 |
3 | 110110201101000201202012 |
4 | 1321133133333311213 |
5 | 4114131004223333 |
6 | 135532314504435 |
7 | 12265463156462 |
oct | 1713737776547 |
9 | 413641021665 |
10 | 130451242343 |
11 | 50362364194 |
12 | 21347a3511b |
13 | c3bc517b36 |
14 | 64573ac2d9 |
15 | 35d7799e48 |
hex | 1e5f7ffd67 |
130451242343 has 4 divisors (see below), whose sum is σ = 130464154368. Its totient is φ = 130438330320.
The previous prime is 130451242331. The next prime is 130451242351. The reversal of 130451242343 is 343242154031.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-130451242343 is a prime.
It is a super-2 number, since 2×1304512423432 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130451242373) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6440846 + ... + 6461067.
It is an arithmetic number, because the mean of its divisors is an integer number (32616038592).
Almost surely, 2130451242343 is an apocalyptic number.
130451242343 is a deficient number, since it is larger than the sum of its proper divisors (12912025).
130451242343 is a wasteful number, since it uses less digits than its factorization.
130451242343 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12912024.
The product of its (nonzero) digits is 34560, while the sum is 32.
Adding to 130451242343 its reverse (343242154031), we get a palindrome (473693396374).
The spelling of 130451242343 in words is "one hundred thirty billion, four hundred fifty-one million, two hundred forty-two thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •