Base | Representation |
---|---|
bin | 100010101011100110111010… |
… | …011110100101000100110000 |
3 | 202000001202101000101122020211 |
4 | 202223212322132211010300 |
5 | 124443024024323124300 |
6 | 1300223241540513504 |
7 | 44061644036230315 |
oct | 4253467236450460 |
9 | 660052330348224 |
10 | 152530302161200 |
11 | 44667813127777 |
12 | 151354896ab894 |
13 | 67157130b9842 |
14 | 2994712710d0c |
15 | 12979e34534ba |
hex | 8ab9ba7a5130 |
152530302161200 has 30 divisors (see below), whose sum is σ = 366454050943244. Its totient is φ = 61012120864320.
The previous prime is 152530302161189. The next prime is 152530302161207. The reversal of 152530302161200 is 2161203035251.
It is not an unprimeable number, because it can be changed into a prime (152530302161207) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 190662877302 + ... + 190662878101.
Almost surely, 2152530302161200 is an apocalyptic number.
152530302161200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
152530302161200 is an abundant number, since it is smaller than the sum of its proper divisors (213923748782044).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
152530302161200 is a wasteful number, since it uses less digits than its factorization.
152530302161200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 381325755421 (or 381325755410 counting only the distinct ones).
The product of its (nonzero) digits is 10800, while the sum is 31.
Adding to 152530302161200 its reverse (2161203035251), we get a palindrome (154691505196451).
The spelling of 152530302161200 in words is "one hundred fifty-two trillion, five hundred thirty billion, three hundred two million, one hundred sixty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •