Base | Representation |
---|---|
bin | 101011110001110… |
… | …0101011010001101 |
3 | 10210101002012011200 |
4 | 1113203211122031 |
5 | 11002022233221 |
6 | 401432340113 |
7 | 51254556402 |
oct | 12743453215 |
9 | 3711065150 |
10 | 1468946061 |
11 | 6941aaa10 |
12 | 34bb44639 |
13 | 1a543b66b |
14 | dd13c2a9 |
15 | 88e63426 |
hex | 578e568d |
1468946061 has 12 divisors (see below), whose sum is σ = 2314703040. Its totient is φ = 890270280.
The previous prime is 1468946053. The next prime is 1468946071. The reversal of 1468946061 is 1606498641.
It is not a de Polignac number, because 1468946061 - 23 = 1468946053 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1468945998 and 1468946016.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1468946071) 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 11 ways as a sum of consecutive naturals, for example, 7418821 + ... + 7419018.
It is an arithmetic number, because the mean of its divisors is an integer number (192891920).
Almost surely, 21468946061 is an apocalyptic number.
1468946061 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1468946061 is a deficient number, since it is larger than the sum of its proper divisors (845756979).
1468946061 is a wasteful number, since it uses less digits than its factorization.
1468946061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14837856 (or 14837853 counting only the distinct ones).
The product of its (nonzero) digits is 248832, while the sum is 45.
The square root of 1468946061 is about 38326.8321284189. The cubic root of 1468946061 is about 1136.7595628257.
The spelling of 1468946061 in words is "one billion, four hundred sixty-eight million, nine hundred forty-six thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •