Base | Representation |
---|---|
bin | 1100010101101101000111… |
… | …0101101000111001011010 |
3 | 1210000222212110020210221210 |
4 | 3011123101311220321122 |
5 | 3234240232432020213 |
6 | 44504334541443550 |
7 | 2600120403424554 |
oct | 305332165507132 |
9 | 53028773223853 |
10 | 13567027220058 |
11 | 43608201a0734 |
12 | 1631469b705b6 |
13 | 7754993a9b40 |
14 | 34c90d1024d4 |
15 | 187d999120c3 |
hex | c56d1d68e5a |
13567027220058 has 32 divisors (see below), whose sum is σ = 29621581045056. Its totient is φ = 4117285392768.
The previous prime is 13567027220051. The next prime is 13567027220063. The reversal of 13567027220058 is 85002272076531.
It is a junction number, because it is equal to n+sod(n) for n = 13567027219989 and 13567027220016.
It is not an unprimeable number, because it can be changed into a prime (13567027220051) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 1191338460 + ... + 1191349847.
It is an arithmetic number, because the mean of its divisors is an integer number (925674407658).
Almost surely, 213567027220058 is an apocalyptic number.
13567027220058 is an abundant number, since it is smaller than the sum of its proper divisors (16054553824998).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13567027220058 is a wasteful number, since it uses less digits than its factorization.
13567027220058 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2382688398.
The product of its (nonzero) digits is 1411200, while the sum is 48.
Adding to 13567027220058 its reverse (85002272076531), we get a palindrome (98569299296589).
The spelling of 13567027220058 in words is "thirteen trillion, five hundred sixty-seven billion, twenty-seven million, two hundred twenty thousand, fifty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.164 sec. • engine limits •