Search a number
-
+
10141152467 = 63116071557
BaseRepresentation
bin10010111000111010…
…11011010011010011
3222011202100220220112
421130131123103103
5131232113334332
64354144031535
7506210242115
oct113435332323
928152326815
1010141152467
114334463a46
121b703025ab
13c5800c244
146c2bc73b5
153e5490db2
hex25c75b4d3

10141152467 has 4 divisors (see below), whose sum is σ = 10157224656. Its totient is φ = 10125080280.

The previous prime is 10141152451. The next prime is 10141152491. The reversal of 10141152467 is 76425114101.

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

It is a cyclic number.

It is not a de Polignac number, because 10141152467 - 24 = 10141152451 is a prime.

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (10141152167) 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 3 ways as a sum of consecutive naturals, for example, 8035148 + ... + 8036409.

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

Almost surely, 210141152467 is an apocalyptic number.

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

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

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

The sum of its prime factors is 16072188.

The product of its (nonzero) digits is 6720, while the sum is 32.

Adding to 10141152467 its reverse (76425114101), we get a palindrome (86566266568).

The spelling of 10141152467 in words is "ten billion, one hundred forty-one million, one hundred fifty-two thousand, four hundred sixty-seven".

Divisors: 1 631 16071557 10141152467