Base | Representation |
---|---|
bin | 1111101110111000100… |
… | …10000001110001001010 |
3 | 1220200022000110210121020 |
4 | 13313130102001301022 |
5 | 32324040024002404 |
6 | 1052155522453310 |
7 | 54024513334200 |
oct | 7673422016112 |
9 | 1820260423536 |
10 | 540566625354 |
11 | 199286849558 |
12 | 88922804236 |
13 | 3bc8a711bc2 |
14 | 1c240b6b070 |
15 | e0dc243ed9 |
hex | 7ddc481c4a |
540566625354 has 24 divisors (see below), whose sum is σ = 1257644802528. Its totient is φ = 154447607160.
The previous prime is 540566625353. The next prime is 540566625373. The reversal of 540566625354 is 453526665045.
It is a super-4 number, since 4×5405666253544 (a number of 48 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 540566625297 and 540566625306.
It is not an unprimeable number, because it can be changed into a prime (540566625353) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 919330702 + ... + 919331289.
It is an arithmetic number, because the mean of its divisors is an integer number (52401866772).
Almost surely, 2540566625354 is an apocalyptic number.
540566625354 is an abundant number, since it is smaller than the sum of its proper divisors (717078177174).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
540566625354 is a wasteful number, since it uses less digits than its factorization.
540566625354 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1838662010 (or 1838662003 counting only the distinct ones).
The product of its (nonzero) digits is 12960000, while the sum is 51.
The spelling of 540566625354 in words is "five hundred forty billion, five hundred sixty-six million, six hundred twenty-five thousand, three hundred fifty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •