Base | Representation |
---|---|
bin | 101011110000011… |
… | …0110110011100101 |
3 | 10210022201212010200 |
4 | 1113200312303211 |
5 | 11001331342020 |
6 | 401405141113 |
7 | 51245520342 |
oct | 12740666345 |
9 | 3708655120 |
10 | 1468230885 |
11 | 693861660 |
12 | 34b85a799 |
13 | 1a524ac94 |
14 | dcdd37c9 |
15 | 88d71590 |
hex | 57836ce5 |
1468230885 has 96 divisors (see below), whose sum is σ = 2858139648. Its totient is φ = 691148160.
The previous prime is 1468230851. The next prime is 1468230893. The reversal of 1468230885 is 5880328641.
It is not a de Polignac number, because 1468230885 - 29 = 1468230373 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a self number, because there is not a number n which added to its sum of digits gives 1468230885.
It is a congruent number.
It is an unprimeable number.
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 95 ways as a sum of consecutive naturals, for example, 5187954 + ... + 5188236.
It is an arithmetic number, because the mean of its divisors is an integer number (29772288).
Almost surely, 21468230885 is an apocalyptic number.
1468230885 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1468230885 is a deficient number, since it is larger than the sum of its proper divisors (1389908763).
1468230885 is a wasteful number, since it uses less digits than its factorization.
1468230885 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 575 (or 572 counting only the distinct ones).
The product of its (nonzero) digits is 368640, while the sum is 45.
The square root of 1468230885 is about 38317.5010275983. The cubic root of 1468230885 is about 1136.5750506888.
The spelling of 1468230885 in words is "one billion, four hundred sixty-eight million, two hundred thirty thousand, eight hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •