Base | Representation |
---|---|
bin | 101011110001000… |
… | …1110111101100000 |
3 | 10210100102012110010 |
4 | 1113202032331200 |
5 | 11001424420333 |
6 | 401421004520 |
7 | 51251553144 |
oct | 12742167540 |
9 | 3710365403 |
10 | 1468591968 |
11 | 693a88978 |
12 | 34b9b3740 |
13 | 1a534643c |
14 | dd089224 |
15 | 88de3563 |
hex | 5788ef60 |
1468591968 has 48 divisors (see below), whose sum is σ = 3863946240. Its totient is φ = 488401536.
The previous prime is 1468591963. The next prime is 1468591979. The reversal of 1468591968 is 8691958641.
1468591968 is digitally balanced in base 4, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (48).
It is a super-2 number, since 2×14685919682 = 4313524736948226048, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1468591963) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 24721 + ... + 59567.
It is an arithmetic number, because the mean of its divisors is an integer number (80498880).
Almost surely, 21468591968 is an apocalyptic number.
It is an amenable number.
1468591968 is an abundant number, since it is smaller than the sum of its proper divisors (2395354272).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1468591968 is a wasteful number, since it uses less digits than its factorization.
1468591968 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 35299 (or 35291 counting only the distinct ones).
The product of its digits is 3732480, while the sum is 57.
The square root of 1468591968 is about 38322.2124622261. The cubic root of 1468591968 is about 1136.6682159384.
The spelling of 1468591968 in words is "one billion, four hundred sixty-eight million, five hundred ninety-one thousand, nine hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •