Base | Representation |
---|---|
bin | 1011011010100100… |
… | …01011101001001011 |
3 | 120211002202112010012 |
4 | 11231102023221023 |
5 | 100022340400443 |
6 | 2452041542135 |
7 | 304603652345 |
oct | 55522135113 |
9 | 16732675105 |
10 | 6128450123 |
11 | 2665394314 |
12 | 12304a494b |
13 | 768890c63 |
14 | 421cc8295 |
15 | 25d05c118 |
hex | 16d48ba4b |
6128450123 has 2 divisors, whose sum is σ = 6128450124. Its totient is φ = 6128450122.
The previous prime is 6128450101. The next prime is 6128450131. The reversal of 6128450123 is 3210548216.
6128450123 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 6128450123 - 218 = 6128187979 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 6128450123.
It is not a weakly prime, because it can be changed into another prime (6128450623) 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 as a sum of consecutive naturals, namely, 3064225061 + 3064225062.
It is an arithmetic number, because the mean of its divisors is an integer number (3064225062).
Almost surely, 26128450123 is an apocalyptic number.
6128450123 is a deficient number, since it is larger than the sum of its proper divisors (1).
6128450123 is an equidigital number, since it uses as much as digits as its factorization.
6128450123 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11520, while the sum is 32.
The square root of 6128450123 is about 78284.4181366892. The cubic root of 6128450123 is about 1829.9963294341.
Adding to 6128450123 its reverse (3210548216), we get a palindrome (9338998339).
The spelling of 6128450123 in words is "six billion, one hundred twenty-eight million, four hundred fifty thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •