Search a number
-
+
10161256251 = 33387085417
BaseRepresentation
bin10010111011010100…
…00111011100111011
3222020011012022010010
421131222013130323
5131302240200001
64400142553003
7506543152536
oct113552073473
928204168103
1010161256251
114344845243
121b76b98763
13c5c22a983
146c573ba1d
153e71128d6
hex25da8773b

10161256251 has 4 divisors (see below), whose sum is σ = 13548341672. Its totient is φ = 6774170832.

The previous prime is 10161256223. The next prime is 10161256267. The reversal of 10161256251 is 15265216101.

It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 15265216101 = 35088405367.

It is not a de Polignac number, because 10161256251 - 215 = 10161223483 is a prime.

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

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (10161256151) by changing a digit.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1693542706 + ... + 1693542711.

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

Almost surely, 210161256251 is an apocalyptic number.

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

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

10161256251 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 3387085420.

The product of its (nonzero) digits is 3600, while the sum is 30.

The spelling of 10161256251 in words is "ten billion, one hundred sixty-one million, two hundred fifty-six thousand, two hundred fifty-one".

Divisors: 1 3 3387085417 10161256251