Base | Representation |
---|---|
bin | 101011100001100… |
… | …0100001001110010 |
3 | 10202210001002022100 |
4 | 1113003010021302 |
5 | 10442331434414 |
6 | 400525521230 |
7 | 51122242566 |
oct | 12703041162 |
9 | 3683032270 |
10 | 1460421234 |
11 | 68a4080a8 |
12 | 349113216 |
13 | 1a374539c |
14 | dbd5d6a6 |
15 | 8832c609 |
hex | 570c4272 |
1460421234 has 12 divisors (see below), whose sum is σ = 3164246046. Its totient is φ = 486807072.
The previous prime is 1460421197. The next prime is 1460421269. The reversal of 1460421234 is 4321240641.
It is a happy number.
1460421234 is a `hidden beast` number, since 1 + 4 + 6 + 0 + 421 + 234 = 666.
It can be written as a sum of positive squares in only one way, i.e., 745126209 + 715295025 = 27297^2 + 26745^2 .
It is a junction number, because it is equal to n+sod(n) for n = 1460421198 and 1460421207.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 40567239 + ... + 40567274.
Almost surely, 21460421234 is an apocalyptic number.
1460421234 is an abundant number, since it is smaller than the sum of its proper divisors (1703824812).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1460421234 is a wasteful number, since it uses less digits than its factorization.
1460421234 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 81134521 (or 81134518 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 27.
The square root of 1460421234 is about 38215.4580503754. The cubic root of 1460421234 is about 1134.5562857687.
Adding to 1460421234 its reverse (4321240641), we get a palindrome (5781661875).
The spelling of 1460421234 in words is "one billion, four hundred sixty million, four hundred twenty-one thousand, two hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •