Base | Representation |
---|---|
bin | 1001101110011000111… |
… | …00010010111000001011 |
3 | 1011221110221222020220011 |
4 | 10313030130102320023 |
5 | 20433310431414321 |
6 | 413300344212351 |
7 | 33066234654412 |
oct | 4671434227013 |
9 | 1157427866804 |
10 | 334142451211 |
11 | 119788780228 |
12 | 5491376a0b7 |
13 | 256814a036a |
14 | 1225b7c2479 |
15 | 8a59ceaae1 |
hex | 4dcc712e0b |
334142451211 has 4 divisors (see below), whose sum is σ = 334204901424. Its totient is φ = 334080001000.
The previous prime is 334142451193. The next prime is 334142451301. The reversal of 334142451211 is 112154241433.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 334142451211 - 227 = 334008233483 is a prime.
It is a super-2 number, since 2×3341424512112 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (334142457211) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 31217080 + ... + 31227781.
It is an arithmetic number, because the mean of its divisors is an integer number (83551225356).
Almost surely, 2334142451211 is an apocalyptic number.
334142451211 is a deficient number, since it is larger than the sum of its proper divisors (62450213).
334142451211 is an equidigital number, since it uses as much as digits as its factorization.
334142451211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62450212.
The product of its digits is 11520, while the sum is 31.
Adding to 334142451211 its reverse (112154241433), we get a palindrome (446296692644).
The spelling of 334142451211 in words is "three hundred thirty-four billion, one hundred forty-two million, four hundred fifty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •