Base | Representation |
---|---|
bin | 11110110011000110100… |
… | …11101011000011011001 |
3 | 10202011110201210011102010 |
4 | 33121203103223003121 |
5 | 114314222340300111 |
6 | 2130050535500133 |
7 | 136311610031034 |
oct | 17314323530331 |
9 | 3664421704363 |
10 | 1058228056281 |
11 | 378879171460 |
12 | 151112527649 |
13 | 78a378aa006 |
14 | 3930b84801b |
15 | 1c7d8653aa6 |
hex | f6634eb0d9 |
1058228056281 has 64 divisors (see below), whose sum is σ = 1654433703936. Its totient is φ = 594511948800.
The previous prime is 1058228056187. The next prime is 1058228056321. The reversal of 1058228056281 is 1826508228501.
It is not a de Polignac number, because 1058228056281 - 210 = 1058228055257 is a prime.
It is a super-3 number, since 3×10582280562813 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a self number, because there is not a number n which added to its sum of digits gives 1058228056281.
It is not an unprimeable number, because it can be changed into a prime (1058228052281) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 40335690 + ... + 40361916.
It is an arithmetic number, because the mean of its divisors is an integer number (25850526624).
Almost surely, 21058228056281 is an apocalyptic number.
1058228056281 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1058228056281 is a deficient number, since it is larger than the sum of its proper divisors (596205647655).
1058228056281 is a wasteful number, since it uses less digits than its factorization.
1058228056281 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27342.
The product of its (nonzero) digits is 614400, while the sum is 48.
The spelling of 1058228056281 in words is "one trillion, fifty-eight billion, two hundred twenty-eight million, fifty-six thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •