Base | Representation |
---|---|
bin | 1100000001101100110011… |
… | …0010110110111000011110 |
3 | 1201211010202122221022202021 |
4 | 3000123030302312320132 |
5 | 3213122402334034100 |
6 | 44042415415450354 |
7 | 2533232551556551 |
oct | 300331462667036 |
9 | 51733678838667 |
10 | 13223345221150 |
11 | 4238a97711099 |
12 | 15969336869ba |
13 | 74bc577386cc |
14 | 33a0287ba698 |
15 | 17de823ada1a |
hex | c06cccb6e1e |
13223345221150 has 24 divisors (see below), whose sum is σ = 25195310459424. Its totient is φ = 5160329841600.
The previous prime is 13223345221127. The next prime is 13223345221159. The reversal of 13223345221150 is 5112254332231.
13223345221150 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13223345221159) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3225204102 + ... + 3225208201.
It is an arithmetic number, because the mean of its divisors is an integer number (1049804602476).
Almost surely, 213223345221150 is an apocalyptic number.
13223345221150 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13223345221150 is a deficient number, since it is larger than the sum of its proper divisors (11971965238274).
13223345221150 is a wasteful number, since it uses less digits than its factorization.
13223345221150 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6450412356 (or 6450412351 counting only the distinct ones).
The product of its (nonzero) digits is 43200, while the sum is 34.
Adding to 13223345221150 its reverse (5112254332231), we get a palindrome (18335599553381).
The spelling of 13223345221150 in words is "thirteen trillion, two hundred twenty-three billion, three hundred forty-five million, two hundred twenty-one thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •