Base | Representation |
---|---|
bin | 11000011011001101… |
… | …11110010010111010 |
3 | 1020211212211201022010 |
4 | 30031212332102322 |
5 | 203323441103310 |
6 | 10005113510350 |
7 | 642646356615 |
oct | 141546762272 |
9 | 36755751263 |
10 | 13113222330 |
11 | 561a08802a |
12 | 265b7123b6 |
13 | 130c994970 |
14 | 8c57dd17c |
15 | 51b369320 |
hex | 30d9be4ba |
13113222330 has 64 divisors (see below), whose sum is σ = 33907886208. Its totient is φ = 3226417920.
The previous prime is 13113222319. The next prime is 13113222341. The reversal of 13113222330 is 3322231131.
It is an interprime number because it is at equal distance from previous prime (13113222319) and next prime (13113222341).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 13113222297 and 13113222306.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1049520 + ... + 1061940.
It is an arithmetic number, because the mean of its divisors is an integer number (529810722).
Almost surely, 213113222330 is an apocalyptic number.
13113222330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13113222330 is an abundant number, since it is smaller than the sum of its proper divisors (20794663878).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13113222330 is a wasteful number, since it uses less digits than its factorization.
13113222330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15151.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 13113222330 its reverse (3322231131), we get a palindrome (16435453461).
The spelling of 13113222330 in words is "thirteen billion, one hundred thirteen million, two hundred twenty-two thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •