Search a number
-
+
10130999448569 is a prime number
BaseRepresentation
bin1001001101101100111010…
…0111111001001111111001
31022212111212202210202010212
42103123032213321033321
52311441241324323234
633314041125520505
72063640416315006
oct223331647711771
938774782722125
1010130999448569
11325659508a6aa
121177557273135
1358647010622c
142704b32408ad
151287e58c95ce
hex936ce9f93f9

10130999448569 has 2 divisors, whose sum is σ = 10130999448570. Its totient is φ = 10130999448568.

The previous prime is 10130999448517. The next prime is 10130999448587. The reversal of 10130999448569 is 96584499903101.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 7725981589225 + 2405017859344 = 2779565^2 + 1550812^2 .

It is a cyclic number.

It is not a de Polignac number, because 10130999448569 - 220 = 10130998399993 is a prime.

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

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

It is not a weakly prime, because it can be changed into another prime (10130999448509) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5065499724284 + 5065499724285.

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

Almost surely, 210130999448569 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 75582720, while the sum is 68.

The spelling of 10130999448569 in words is "ten trillion, one hundred thirty billion, nine hundred ninety-nine million, four hundred forty-eight thousand, five hundred sixty-nine".