Base | Representation |
---|---|
bin | 11010100101010100110101… |
… | …11011100110010100010001 |
3 | 21122222110000002202122010122 |
4 | 31102222122323212110101 |
5 | 30130230122134311030 |
6 | 324154453431040025 |
7 | 15212246352224222 |
oct | 1522523273462421 |
9 | 248873002678118 |
10 | 58457104213265 |
11 | 1769857839a2aa |
12 | 6681465b10015 |
13 | 2680634488574 |
14 | 10614a60a3249 |
15 | 6b590b8b58e5 |
hex | 352a9aee6511 |
58457104213265 has 32 divisors (see below), whose sum is σ = 74000593612800. Its totient is φ = 44208321842880.
The previous prime is 58457104213237. The next prime is 58457104213351. The reversal of 58457104213265 is 56231240175485.
58457104213265 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a de Polignac number, because none of the positive numbers 2k-58457104213265 is a prime.
It is a super-2 number, since 2×584571042132652 (a number of 28 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 668106170 + ... + 668193660.
It is an arithmetic number, because the mean of its divisors is an integer number (2312518550400).
Almost surely, 258457104213265 is an apocalyptic number.
It is an amenable number.
58457104213265 is a deficient number, since it is larger than the sum of its proper divisors (15543489399535).
58457104213265 is a wasteful number, since it uses less digits than its factorization.
58457104213265 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 102677.
The product of its (nonzero) digits is 8064000, while the sum is 53.
The spelling of 58457104213265 in words is "fifty-eight trillion, four hundred fifty-seven billion, one hundred four million, two hundred thirteen thousand, two hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •