Base | Representation |
---|---|
bin | 1001011111111111101… |
… | …0001110100001000000 |
3 | 120121021012020000102211 |
4 | 2113333322032201000 |
5 | 10133222023300330 |
6 | 202550521351504 |
7 | 14535266453224 |
oct | 2277772164100 |
9 | 517235200384 |
10 | 163207243840 |
11 | 63241263a03 |
12 | 27769938594 |
13 | 1250c873644 |
14 | 7c83866784 |
15 | 43a331bd2a |
hex | 25ffe8e840 |
163207243840 has 28 divisors (see below), whose sum is σ = 388637250156. Its totient is φ = 65282897408.
The previous prime is 163207243817. The next prime is 163207243847. The reversal of 163207243840 is 48342702361.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 37925225536 + 125282018304 = 194744^2 + 353952^2 .
It is a Harshad number since it is a multiple of its sum of digits (40).
It is a junction number, because it is equal to n+sod(n) for n = 163207243793 and 163207243802.
It is not an unprimeable number, because it can be changed into a prime (163207243847) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 255010999 + ... + 255011638.
Almost surely, 2163207243840 is an apocalyptic number.
163207243840 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
163207243840 is an abundant number, since it is smaller than the sum of its proper divisors (225430006316).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
163207243840 is an equidigital number, since it uses as much as digits as its factorization.
163207243840 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 510022654 (or 510022644 counting only the distinct ones).
The product of its (nonzero) digits is 193536, while the sum is 40.
The spelling of 163207243840 in words is "one hundred sixty-three billion, two hundred seven million, two hundred forty-three thousand, eight hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •