Base | Representation |
---|---|
bin | 100111110000011… |
… | …1000110001100101 |
3 | 10102222012022002101 |
4 | 1033200320301211 |
5 | 10213002134341 |
6 | 340212412101 |
7 | 45025664461 |
oct | 11740706145 |
9 | 3388168071 |
10 | 1334021221 |
11 | 625024985 |
12 | 312917031 |
13 | 1834ba390 |
14 | c92594a1 |
15 | 7c1b0831 |
hex | 4f838c65 |
1334021221 has 8 divisors (see below), whose sum is σ = 1437004800. Its totient is φ = 1231090032.
The previous prime is 1334021219. The next prime is 1334021237. The reversal of 1334021221 is 1221204331.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1334021221 - 21 = 1334021219 is a prime.
It is a super-4 number, since 4×13340212214 (a number of 38 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1334021251) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 51696 + ... + 73078.
It is an arithmetic number, because the mean of its divisors is an integer number (179625600).
Almost surely, 21334021221 is an apocalyptic number.
It is an amenable number.
1334021221 is a deficient number, since it is larger than the sum of its proper divisors (102983579).
1334021221 is a wasteful number, since it uses less digits than its factorization.
1334021221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26195.
The product of its (nonzero) digits is 288, while the sum is 19.
The square root of 1334021221 is about 36524.2552422359. The cubic root of 1334021221 is about 1100.8316633427.
Adding to 1334021221 its reverse (1221204331), we get a palindrome (2555225552).
The spelling of 1334021221 in words is "one billion, three hundred thirty-four million, twenty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •