Base | Representation |
---|---|
bin | 10001111010101010000… |
… | …001010010111011000110 |
3 | 11100200222100200112120210 |
4 | 101322222001102323012 |
5 | 130133011024104110 |
6 | 2341340025540250 |
7 | 154644415533405 |
oct | 21725201227306 |
9 | 4320870615523 |
10 | 1231213113030 |
11 | 43517778297a |
12 | 17a74a944686 |
13 | 8c1450b5a64 |
14 | 4383bb1763c |
15 | 22060090520 |
hex | 11eaa052ec6 |
1231213113030 has 64 divisors (see below), whose sum is σ = 2967520121280. Its totient is φ = 326925398016.
The previous prime is 1231213113029. The next prime is 1231213113047. The reversal of 1231213113030 is 303113121321.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 1231213112988 and 1231213113006.
It is a congruent number.
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, 6831354 + ... + 7009266.
It is an arithmetic number, because the mean of its divisors is an integer number (46367501895).
Almost surely, 21231213113030 is an apocalyptic number.
1231213113030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1231213113030 is an abundant number, since it is smaller than the sum of its proper divisors (1736307008250).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1231213113030 is a wasteful number, since it uses less digits than its factorization.
1231213113030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 178905.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 1231213113030 its reverse (303113121321), we get a palindrome (1534326234351).
The spelling of 1231213113030 in words is "one trillion, two hundred thirty-one billion, two hundred thirteen million, one hundred thirteen thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •