Base | Representation |
---|---|
bin | 1000111010000100100… |
… | …0101101000101101001 |
3 | 112121222201210201012111 |
4 | 2032201020231011221 |
5 | 10001344440101334 |
6 | 154144425242321 |
7 | 14025105216211 |
oct | 2164110550551 |
9 | 477881721174 |
10 | 153027268969 |
11 | 599979a4133 |
12 | 257a86333a1 |
13 | 115797c0883 |
14 | 7599855241 |
15 | 3ea975d064 |
hex | 23a122d169 |
153027268969 has 9 divisors (see below), whose sum is σ = 162565443831. Its totient is φ = 144019405920.
The previous prime is 153027268957. The next prime is 153027268987. The reversal of 153027268969 is 969862720351.
The square root of 153027268969 is 391187.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 119138877225 + 33888391744 = 345165^2 + 184088^2 .
It is not a de Polignac number, because 153027268969 - 223 = 153018880361 is a prime.
It is a super-2 number, since 2×1530272689692 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (153027268909) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 6638674 + ... + 6661684.
Almost surely, 2153027268969 is an apocalyptic number.
153027268969 is the 391187-th square number.
153027268969 is the 195594-th centered octagonal number.
It is an amenable number.
153027268969 is a deficient number, since it is larger than the sum of its proper divisors (9538174862).
153027268969 is an frugal number, since it uses more digits than its factorization.
153027268969 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 46056 (or 23028 counting only the distinct ones).
The product of its (nonzero) digits is 9797760, while the sum is 58.
The spelling of 153027268969 in words is "one hundred fifty-three billion, twenty-seven million, two hundred sixty-eight thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •