Base | Representation |
---|---|
bin | 101000001111101… |
… | …1100101011011100 |
3 | 10111010001111122110 |
4 | 1100133130223130 |
5 | 10231201434322 |
6 | 342000114020 |
7 | 45315251040 |
oct | 12037345334 |
9 | 3433044573 |
10 | 1350421212 |
11 | 633306498 |
12 | 318305910 |
13 | 186a1000a |
14 | cb4c8020 |
15 | 7d84ec0c |
hex | 507dcadc |
1350421212 has 24 divisors (see below), whose sum is σ = 3601123456. Its totient is φ = 385834608.
The previous prime is 1350421201. The next prime is 1350421243. The reversal of 1350421212 is 2121240531.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
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 7 ways as a sum of consecutive naturals, for example, 8038138 + ... + 8038305.
Almost surely, 21350421212 is an apocalyptic number.
1350421212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1350421212 is an abundant number, since it is smaller than the sum of its proper divisors (2250702244).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1350421212 is a wasteful number, since it uses less digits than its factorization.
1350421212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16076457 (or 16076455 counting only the distinct ones).
The product of its (nonzero) digits is 480, while the sum is 21.
The square root of 1350421212 is about 36748.0776640085. The cubic root of 1350421212 is about 1105.3243826970.
Adding to 1350421212 its reverse (2121240531), we get a palindrome (3471661743).
It can be divided in two parts, 13504 and 21212, that added together give a triangular number (34716 = T263).
The spelling of 1350421212 in words is "one billion, three hundred fifty million, four hundred twenty-one thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •