Base | Representation |
---|---|
bin | 10110010111000000… |
… | …01010100100010010 |
3 | 1010222120220120012001 |
4 | 23023200022210102 |
5 | 144041030010310 |
6 | 5303054224214 |
7 | 603321342406 |
oct | 131340124422 |
9 | 33876816161 |
10 | 12004141330 |
11 | 5100030065 |
12 | 23b01b506a |
13 | 1193c8480c |
14 | 81c3b9106 |
15 | 4a3cdc93a |
hex | 2cb80a912 |
12004141330 has 8 divisors (see below), whose sum is σ = 21607454412. Its totient is φ = 4801656528.
The previous prime is 12004141327. The next prime is 12004141339. The reversal of 12004141330 is 3314140021.
It can be written as a sum of positive squares in 2 ways, for example, as 11594767041 + 409374289 = 107679^2 + 20233^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×120041413302 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 12004141298 and 12004141307.
It is not an unprimeable number, because it can be changed into a prime (12004141339) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 600207057 + ... + 600207076.
Almost surely, 212004141330 is an apocalyptic number.
12004141330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12004141330 is a deficient number, since it is larger than the sum of its proper divisors (9603313082).
12004141330 is a wasteful number, since it uses less digits than its factorization.
12004141330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1200414140.
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 12004141330 its reverse (3314140021), we get a palindrome (15318281351).
The spelling of 12004141330 in words is "twelve billion, four million, one hundred forty-one thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.114 sec. • engine limits •