Base | Representation |
---|---|
bin | 10010011000101… |
… | …011111101101101 |
3 | 210111102110112002 |
4 | 102120223331231 |
5 | 1112431231141 |
6 | 50335222045 |
7 | 10433610302 |
oct | 2230537555 |
9 | 714373462 |
10 | 308461421 |
11 | 1491336a4 |
12 | 87377925 |
13 | 4bba1268 |
14 | 2cd770a9 |
15 | 1c130e9b |
hex | 1262bf6d |
308461421 has 4 divisors (see below), whose sum is σ = 309090144. Its totient is φ = 307832700.
The previous prime is 308461399. The next prime is 308461453. The reversal of 308461421 is 124164803.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 124164803 = 7 ⋅17737829.
It is a cyclic number.
It is not a de Polignac number, because 308461421 - 26 = 308461357 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (308461121) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 313625 + ... + 314606.
It is an arithmetic number, because the mean of its divisors is an integer number (77272536).
Almost surely, 2308461421 is an apocalyptic number.
It is an amenable number.
308461421 is a deficient number, since it is larger than the sum of its proper divisors (628723).
308461421 is an equidigital number, since it uses as much as digits as its factorization.
308461421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 628722.
The product of its (nonzero) digits is 4608, while the sum is 29.
The square root of 308461421 is about 17563.0698057031. The cubic root of 308461421 is about 675.6684158919.
The spelling of 308461421 in words is "three hundred eight million, four hundred sixty-one thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •