Base | Representation |
---|---|
bin | 111100010010110101010101… |
… | …0011111110111100011011010 |
3 | 2120112211100101222112200122201 |
4 | 1320211222222133313203122 |
5 | 1024003310004101003102 |
6 | 5115545134125240414 |
7 | 216465545554100023 |
oct | 17045525237674332 |
9 | 2515740358480581 |
10 | 530354012125402 |
11 | 143a949675a9393 |
12 | 4b5961b170310a |
13 | 199c122697a04a |
14 | 94d73b2067c4a |
15 | 414aad1a98987 |
hex | 1e25aaa7f78da |
530354012125402 has 32 divisors (see below), whose sum is σ = 853034367052800. Its totient is φ = 246406127355648.
The previous prime is 530354012125393. The next prime is 530354012125423. The reversal of 530354012125402 is 204521210453035.
It is a happy number.
It is a super-2 number, since 2×5303540121254022 (a number of 30 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 45757999 + ... + 56164957.
It is an arithmetic number, because the mean of its divisors is an integer number (26657323970400).
Almost surely, 2530354012125402 is an apocalyptic number.
530354012125402 is a deficient number, since it is larger than the sum of its proper divisors (322680354927398).
530354012125402 is a wasteful number, since it uses less digits than its factorization.
530354012125402 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10426030.
The product of its (nonzero) digits is 144000, while the sum is 37.
Adding to 530354012125402 its reverse (204521210453035), we get a palindrome (734875222578437).
The spelling of 530354012125402 in words is "five hundred thirty trillion, three hundred fifty-four billion, twelve million, one hundred twenty-five thousand, four hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •