Base | Representation |
---|---|
bin | 1000111000100000001… |
… | …1011010010111001111 |
3 | 112120220101221221200101 |
4 | 2032020003122113033 |
5 | 10000014222414101 |
6 | 154034553511531 |
7 | 14011505301130 |
oct | 2161003322717 |
9 | 476811857611 |
10 | 152606451151 |
11 | 597a13aa510 |
12 | 256ab7125a7 |
13 | 1151057084b |
14 | 75599d1c87 |
15 | 3e82836401 |
hex | 23880da5cf |
152606451151 has 32 divisors (see below), whose sum is σ = 198852756480. Its totient is φ = 113629824000.
The previous prime is 152606451131. The next prime is 152606451169. The reversal of 152606451151 is 151154606251.
It is not a de Polignac number, because 152606451151 - 25 = 152606451119 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 152606451151.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (152606451131) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 135675 + ... + 568876.
It is an arithmetic number, because the mean of its divisors is an integer number (6214148640).
Almost surely, 2152606451151 is an apocalyptic number.
152606451151 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
152606451151 is a deficient number, since it is larger than the sum of its proper divisors (46246305329).
152606451151 is a wasteful number, since it uses less digits than its factorization.
152606451151 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 704695.
The product of its (nonzero) digits is 36000, while the sum is 37.
The spelling of 152606451151 in words is "one hundred fifty-two billion, six hundred six million, four hundred fifty-one thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •