Base | Representation |
---|---|
bin | 10110001110100011001… |
… | …111111100101011011110 |
3 | 12102000121202220021201110 |
4 | 112032203033330223132 |
5 | 200011210234210430 |
6 | 3125411334522450 |
7 | 215232455651142 |
oct | 26164317745336 |
9 | 5360552807643 |
10 | 1527452256990 |
11 | 539874a84390 |
12 | 208044806426 |
13 | b1065a0425a |
14 | 53d01597222 |
15 | 29aec4b67b0 |
hex | 163a33fcade |
1527452256990 has 64 divisors (see below), whose sum is σ = 4044082049280. Its totient is φ = 366130871040.
The previous prime is 1527452256961. The next prime is 1527452256991. The reversal of 1527452256990 is 996522547251.
It is a super-2 number, since 2×15274522569902 (a number of 25 digits) contains 22 as substring.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1527452256990.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1527452256991) 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, 25974244 + ... + 26032983.
It is an arithmetic number, because the mean of its divisors is an integer number (63188782020).
Almost surely, 21527452256990 is an apocalyptic number.
1527452256990 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1527452256990 is an abundant number, since it is smaller than the sum of its proper divisors (2516629792290).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1527452256990 is a wasteful number, since it uses less digits than its factorization.
1527452256990 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52007337.
The product of its (nonzero) digits is 13608000, while the sum is 57.
The spelling of 1527452256990 in words is "one trillion, five hundred twenty-seven billion, four hundred fifty-two million, two hundred fifty-six thousand, nine hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.185 sec. • engine limits •