Base | Representation |
---|---|
bin | 101011110001010… |
… | …0110110000011000 |
3 | 10210100121011010220 |
4 | 1113202212300120 |
5 | 11001441030212 |
6 | 401423040040 |
7 | 51252440250 |
oct | 12742466030 |
9 | 3710534126 |
10 | 1468689432 |
11 | 694045121 |
12 | 34ba40020 |
13 | 1a537b902 |
14 | dd0b2960 |
15 | 88e1238c |
hex | 578a6c18 |
1468689432 has 64 divisors (see below), whose sum is σ = 4443102720. Its totient is φ = 394940928.
The previous prime is 1468689407. The next prime is 1468689437. The reversal of 1468689432 is 2349868641.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1468689437) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 254268 + ... + 259979.
It is an arithmetic number, because the mean of its divisors is an integer number (69423480).
Almost surely, 21468689432 is an apocalyptic number.
1468689432 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1468689432 is an abundant number, since it is smaller than the sum of its proper divisors (2974413288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1468689432 is a wasteful number, since it uses less digits than its factorization.
1468689432 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 514280 (or 514276 counting only the distinct ones).
The product of its digits is 1990656, while the sum is 51.
The square root of 1468689432 is about 38323.4840796084. The cubic root of 1468689432 is about 1136.6933606082.
It can be divided in two parts, 1468 and 689432, that added together give a triangular number (690900 = T1175).
The spelling of 1468689432 in words is "one billion, four hundred sixty-eight million, six hundred eighty-nine thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •