Search a number
-
+
10151461451 = 372203124541
BaseRepresentation
bin10010111010001001…
…10000001001001011
3222012110202200011202
421131010300021023
5131242233231301
64355153014415
7506363666345
oct113504601113
928173680152
1010151461451
11433a26526a
121b7385440b
13c5a1ab631
146c430c295
153e632a66b
hex25d13024b

10151461451 has 8 divisors (see below), whose sum is σ = 10430641584. Its totient is φ = 9872534880.

The previous prime is 10151461421. The next prime is 10151461487. The reversal of 10151461451 is 15416415101.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-10151461451 is a prime.

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

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 19241 + ... + 143781.

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

Almost surely, 210151461451 is an apocalyptic number.

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

10151461451 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 126781.

The product of its (nonzero) digits is 2400, while the sum is 29.

Adding to 10151461451 its reverse (15416415101), we get a palindrome (25567876552).

The spelling of 10151461451 in words is "ten billion, one hundred fifty-one million, four hundred sixty-one thousand, four hundred fifty-one".

Divisors: 1 37 2203 81511 124541 4608017 274363823 10151461451