Base | Representation |
---|---|
bin | 1011110110101000100000… |
… | …0010011010101101011010 |
3 | 1201010222000000211101111112 |
4 | 2331222020002122231122 |
5 | 3202014010024024010 |
6 | 43415213032500322 |
7 | 2513422112365232 |
oct | 275521002325532 |
9 | 51128000741445 |
10 | 13033213111130 |
11 | 417539a031773 |
12 | 1565b1084a6a2 |
13 | 73704692c9b4 |
14 | 330b4d0accc2 |
15 | 1790553eda05 |
hex | bda8809ab5a |
13033213111130 has 16 divisors (see below), whose sum is σ = 23844370217544. Its totient is φ = 5127821551680.
The previous prime is 13033213111103. The next prime is 13033213111159. The reversal of 13033213111130 is 3111131233031.
It can be written as a sum of positive squares in 4 ways, for example, as 3192500577049 + 9840712534081 = 1786757^2 + 3136991^2 .
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 13033213111096 and 13033213111105.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10682960957 + ... + 10682962176.
Almost surely, 213033213111130 is an apocalyptic number.
13033213111130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13033213111130 is a deficient number, since it is larger than the sum of its proper divisors (10811157106414).
13033213111130 is a wasteful number, since it uses less digits than its factorization.
13033213111130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21365923201.
The product of its (nonzero) digits is 486, while the sum is 23.
Adding to 13033213111130 its reverse (3111131233031), we get a palindrome (16144344344161).
The spelling of 13033213111130 in words is "thirteen trillion, thirty-three billion, two hundred thirteen million, one hundred eleven thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •