Base | Representation |
---|---|
bin | 1010001010100100… |
… | …10111100000001100 |
3 | 112002100002011012112 |
4 | 11011102113200030 |
5 | 42134044110220 |
6 | 2301311123152 |
7 | 252145135334 |
oct | 50522274014 |
9 | 15070064175 |
10 | 5457410060 |
11 | 2350624a53 |
12 | 10838134b8 |
13 | 68c85132b |
14 | 39ab2c0c4 |
15 | 21e1aa5c5 |
hex | 14549780c |
5457410060 has 48 divisors (see below), whose sum is σ = 11644469760. Its totient is φ = 2148120000.
The previous prime is 5457410051. The next prime is 5457410069. The reversal of 5457410060 is 600147545.
It is an interprime number because it is at equal distance from previous prime (5457410051) and next prime (5457410069).
It is a junction number, because it is equal to n+sod(n) for n = 5457409999 and 5457410026.
It is not an unprimeable number, because it can be changed into a prime (5457410069) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 479435 + ... + 490685.
It is an arithmetic number, because the mean of its divisors is an integer number (242593120).
Almost surely, 25457410060 is an apocalyptic number.
It is an amenable number.
5457410060 is an abundant number, since it is smaller than the sum of its proper divisors (6187059700).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5457410060 is a wasteful number, since it uses less digits than its factorization.
5457410060 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11646 (or 11644 counting only the distinct ones).
The product of its (nonzero) digits is 16800, while the sum is 32.
The square root of 5457410060 is about 73874.2855126193. The cubic root of 5457410060 is about 1760.6060735516.
The spelling of 5457410060 in words is "five billion, four hundred fifty-seven million, four hundred ten thousand, sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •