Base | Representation |
---|---|
bin | 10011011101101… |
… | …00010111001000 |
3 | 102101012212122110 |
4 | 21232310113020 |
5 | 313244034130 |
6 | 24111222320 |
7 | 4021520055 |
oct | 1156642710 |
9 | 371185573 |
10 | 163268040 |
11 | 84184771 |
12 | 468179a0 |
13 | 27a96110 |
14 | 1798002c |
15 | e500ab0 |
hex | 9bb45c8 |
163268040 has 64 divisors (see below), whose sum is σ = 527486400. Its totient is φ = 40188672.
The previous prime is 163268003. The next prime is 163268047. The reversal of 163268040 is 40862361.
163268040 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 163267989 and 163268007.
It is not an unprimeable number, because it can be changed into a prime (163268047) 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, 50770 + ... + 53889.
It is an arithmetic number, because the mean of its divisors is an integer number (8241975).
Almost surely, 2163268040 is an apocalyptic number.
163268040 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
163268040 is an abundant number, since it is smaller than the sum of its proper divisors (364218360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
163268040 is a wasteful number, since it uses less digits than its factorization.
163268040 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 104686 (or 104682 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 30.
The square root of 163268040 is about 12777.6382794318. The cubic root of 163268040 is about 546.5548171591.
The spelling of 163268040 in words is "one hundred sixty-three million, two hundred sixty-eight thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •