Search a number
-
+
151452505023113 = 7173931243952863
BaseRepresentation
bin100010011011111011001000…
…110000110010001010001001
3201212020201101110221010020002
4202123323020300302022021
5124322344212241214423
61254040153103412345
743621040155555520
oct4233731060621211
9655221343833202
10151452505023113
11442917127aa538
1214ba06155b40b5
136667baa1b03a8
1429584a9d134b7
151279961d03228
hex89bec8c32289

151452505023113 has 8 divisors (see below), whose sum is σ = 173098528931328. Its totient is φ = 129808969055424.

The previous prime is 151452505023049. The next prime is 151452505023151. The reversal of 151452505023113 is 311320505254151.

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

It is a cyclic number.

It is not a de Polignac number, because 151452505023113 - 26 = 151452505023049 is a prime.

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

It is not an unprimeable number, because it can be changed into a prime (151452505023173) 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, 621854681 + ... + 622098182.

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

Almost surely, 2151452505023113 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1243970263.

The product of its (nonzero) digits is 90000, while the sum is 38.

The spelling of 151452505023113 in words is "one hundred fifty-one trillion, four hundred fifty-two billion, five hundred five million, twenty-three thousand, one hundred thirteen".

Divisors: 1 7 17393 121751 1243952863 8707670041 21636072146159 151452505023113