Base | Representation |
---|---|
bin | 1100000010000101101011… |
… | …0001001011000000000000 |
3 | 1201211202222222200111001112 |
4 | 3000201122301023000000 |
5 | 3213230041130024412 |
6 | 44045442132422452 |
7 | 2533560165315443 |
oct | 300413261130000 |
9 | 51752888614045 |
10 | 13230022111232 |
11 | 4240903637473 |
12 | 1598097777a28 |
13 | 74c77cb11a44 |
14 | 33a49d46965a |
15 | 17e223651722 |
hex | c085ac4b000 |
13230022111232 has 52 divisors (see below), whose sum is σ = 27369118421520. Its totient is φ = 6386907168768.
The previous prime is 13230022111181. The next prime is 13230022111283. The reversal of 13230022111232 is 23211122003231.
It is an interprime number because it is at equal distance from previous prime (13230022111181) and next prime (13230022111283).
It is a junction number, because it is equal to n+sod(n) for n = 13230022111198 and 13230022111207.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 55570628 + ... + 55808195.
Almost surely, 213230022111232 is an apocalyptic number.
It is an amenable number.
13230022111232 is an abundant number, since it is smaller than the sum of its proper divisors (14139096310288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13230022111232 is an equidigital number, since it uses as much as digits as its factorization.
13230022111232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 111378876 (or 111378854 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 13230022111232 its reverse (23211122003231), we get a palindrome (36441144114463).
The spelling of 13230022111232 in words is "thirteen trillion, two hundred thirty billion, twenty-two million, one hundred eleven thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •