Base | Representation |
---|---|
bin | 1000110110100000001… |
… | …1001000100000000000 |
3 | 112112111222121100212122 |
4 | 2031220003020200000 |
5 | 4442414243211242 |
6 | 153505413143412 |
7 | 13662265324400 |
oct | 2155003104000 |
9 | 475458540778 |
10 | 152069507072 |
11 | 595462aa47a |
12 | 2557b92ab68 |
13 | 11456251b62 |
14 | 7508580800 |
15 | 3e50621ad2 |
hex | 23680c8800 |
152069507072 has 108 divisors (see below), whose sum is σ = 353995555095. Its totient is φ = 65119703040.
The previous prime is 152069507027. The next prime is 152069507087. The reversal of 152069507072 is 270705960251.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
It can be written as a sum of positive squares in only one way, i.e., 76034753536 + 76034753536 = 275744^2 + 275744^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=275744.
It is a super-2 number, since 2×1520695070722 (a number of 23 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 123532697 + ... + 123533927.
Almost surely, 2152069507072 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 152069507072
152069507072 is an abundant number, since it is smaller than the sum of its proper divisors (201926048023).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
152069507072 is an frugal number, since it uses more digits than its factorization.
152069507072 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2498 (or 1240 counting only the distinct ones).
The product of its (nonzero) digits is 264600, while the sum is 44.
The spelling of 152069507072 in words is "one hundred fifty-two billion, sixty-nine million, five hundred seven thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •