Base | Representation |
---|---|
bin | 100110110011100001000110… |
… | …1110111100110101000010000 |
3 | 1122202120000121102121001021101 |
4 | 1031213002031313212220100 |
5 | 324214340434401030222 |
6 | 3205541433223434144 |
7 | 131616265452264040 |
oct | 11547021567465020 |
9 | 1582500542531241 |
10 | 341332021111312 |
11 | 99839108456640 |
12 | 323485232b5954 |
13 | 1185c618ab834a |
14 | 60407b50d7720 |
15 | 296dc6875c927 |
hex | 136708dde6a10 |
341332021111312 has 80 divisors (see below), whose sum is σ = 825723510884352. Its totient is φ = 132791792031360.
The previous prime is 341332021111307. The next prime is 341332021111369. The reversal of 341332021111312 is 213111120233143.
It is a happy number.
It is a super-2 number, since 2×3413320211113122 (a number of 30 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 201980808 + ... + 203663719.
Almost surely, 2341332021111312 is an apocalyptic number.
It is an amenable number.
341332021111312 is an abundant number, since it is smaller than the sum of its proper divisors (484391489773040).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
341332021111312 is a wasteful number, since it uses less digits than its factorization.
341332021111312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 405645236 (or 405645230 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 28.
Adding to 341332021111312 its reverse (213111120233143), we get a palindrome (554443141344455).
The spelling of 341332021111312 in words is "three hundred forty-one trillion, three hundred thirty-two billion, twenty-one million, one hundred eleven thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •