Search a number
-
+
131000030310022 = 265500015155011
BaseRepresentation
bin11101110010010011010010…
…010001011010111010000110
3122011211110222100110121210021
4131302103102101122322012
5114132301030224410042
61142340325542045354
736410303605120066
oct3562232221327206
9564743870417707
10131000030310022
1138816889a45525
121283882511985a
135813332c03b43
14244c6146553a6
1510229287ea867
hex7724d245ae86

131000030310022 has 4 divisors (see below), whose sum is σ = 196500045465036. Its totient is φ = 65500015155010.

The previous prime is 131000030310001. The next prime is 131000030310041. The reversal of 131000030310022 is 220013030000131.

Adding to 131000030310022 its reverse (220013030000131), we get a palindrome (351013060310153).

It is a semiprime because it is the product of two primes.

It is a super-2 number, since 2×1310000303100222 (a number of 29 digits) contains 22 as substring.

It is a junction number, because it is equal to n+sod(n) for n = 131000030309978 and 131000030310005.

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 as a sum of consecutive naturals, namely, 32750007577504 + ... + 32750007577507.

It is an arithmetic number, because the mean of its divisors is an integer number (49125011366259).

Almost surely, 2131000030310022 is an apocalyptic number.

131000030310022 is a deficient number, since it is larger than the sum of its proper divisors (65500015155014).

131000030310022 is an equidigital number, since it uses as much as digits as its factorization.

131000030310022 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 65500015155013.

The product of its (nonzero) digits is 108, while the sum is 16.

The spelling of 131000030310022 in words is "one hundred thirty-one trillion, thirty million, three hundred ten thousand, twenty-two".

Divisors: 1 2 65500015155011 131000030310022