Base | Representation |
---|---|
bin | 111101101010101111000101… |
… | …1011000000111111011000010 |
3 | 2122010121022011001000222202021 |
4 | 1323111132023120013323002 |
5 | 1032044224324122132000 |
6 | 5201355150024512054 |
7 | 222153436513154434 |
oct | 17325361330077302 |
9 | 2563538131028667 |
10 | 542435233005250 |
11 | 147922543857382 |
12 | 50a076ba01b62a |
13 | 1a3895663c6940 |
14 | 97d40109c8654 |
15 | 42a9eba24a11a |
hex | 1ed578b607ec2 |
542435233005250 has 128 divisors (see below), whose sum is σ = 1151131661971200. Its totient is φ = 189738076492800.
The previous prime is 542435233005229. The next prime is 542435233005283. The reversal of 542435233005250 is 52500332534245.
It is a junction number, because it is equal to n+sod(n) for n = 542435233005197 and 542435233005206.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 3720920362 + ... + 3721066138.
It is an arithmetic number, because the mean of its divisors is an integer number (8993216109150).
Almost surely, 2542435233005250 is an apocalyptic number.
542435233005250 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
542435233005250 is an abundant number, since it is smaller than the sum of its proper divisors (608696428965950).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
542435233005250 is a wasteful number, since it uses less digits than its factorization.
542435233005250 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 206085 (or 206075 counting only the distinct ones).
The product of its (nonzero) digits is 2160000, while the sum is 43.
Adding to 542435233005250 its reverse (52500332534245), we get a palindrome (594935565539495).
The spelling of 542435233005250 in words is "five hundred forty-two trillion, four hundred thirty-five billion, two hundred thirty-three million, five thousand, two hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.030 sec. • engine limits •