Base | Representation |
---|---|
bin | 10001100001011100100… |
… | …010101100000111001010 |
3 | 11021010002211022200120102 |
4 | 101201130202230013022 |
5 | 124212041210042310 |
6 | 2321101552525402 |
7 | 152665540236005 |
oct | 21413442540712 |
9 | 4233084280512 |
10 | 1204143440330 |
11 | 424746642146 |
12 | 175455250862 |
13 | 8971cb4c64c |
14 | 423d093a53c |
15 | 214c88468a5 |
hex | 1185c8ac1ca |
1204143440330 has 32 divisors (see below), whose sum is σ = 2168915086800. Its totient is φ = 481333754880.
The previous prime is 1204143440321. The next prime is 1204143440347. The reversal of 1204143440330 is 330443414021.
It is a happy number.
It can be written as a sum of positive squares in 8 ways, for example, as 1184547080161 + 19596360169 = 1088369^2 + 139987^2 .
It is a super-2 number, since 2×12041434403302 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1204143440293 and 1204143440302.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 128794496 + ... + 128803844.
Almost surely, 21204143440330 is an apocalyptic number.
1204143440330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1204143440330 is a deficient number, since it is larger than the sum of its proper divisors (964771646470).
1204143440330 is a wasteful number, since it uses less digits than its factorization.
1204143440330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16634.
The product of its (nonzero) digits is 13824, while the sum is 29.
Adding to 1204143440330 its reverse (330443414021), we get a palindrome (1534586854351).
The spelling of 1204143440330 in words is "one trillion, two hundred four billion, one hundred forty-three million, four hundred forty thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •