Base | Representation |
---|---|
bin | 11110000110100011111… |
… | …00011011101011101010 |
3 | 10122212202011002010211200 |
4 | 33003101330123223222 |
5 | 113421233443244320 |
6 | 2111054003505030 |
7 | 134504163414354 |
oct | 17032174335352 |
9 | 3585664063750 |
10 | 1034314431210 |
11 | 369717593a55 |
12 | 148559988176 |
13 | 766c64638c8 |
14 | 380bd8940d4 |
15 | 1bd89025290 |
hex | f0d1f1baea |
1034314431210 has 48 divisors (see below), whose sum is σ = 2693053944360. Its totient is φ = 275423702400.
The previous prime is 1034314431193. The next prime is 1034314431221. The reversal of 1034314431210 is 121344134301.
1034314431210 is a `hidden beast` number, since 1 + 0 + 3 + 4 + 3 + 1 + 443 + 1 + 210 = 666.
It can be written as a sum of positive squares in 4 ways, for example, as 1028554987329 + 5759443881 = 1014177^2 + 75891^2 .
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 23 ways as a sum of consecutive naturals, for example, 8134045 + ... + 8260224.
Almost surely, 21034314431210 is an apocalyptic number.
1034314431210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1034314431210 is an abundant number, since it is smaller than the sum of its proper divisors (1658739513150).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1034314431210 is a wasteful number, since it uses less digits than its factorization.
1034314431210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16394983 (or 16394980 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 27.
Adding to 1034314431210 its reverse (121344134301), we get a palindrome (1155658565511).
The spelling of 1034314431210 in words is "one trillion, thirty-four billion, three hundred fourteen million, four hundred thirty-one thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •