Base | Representation |
---|---|
bin | 100101000101011111100101… |
… | …011000010000000110111111 |
3 | 210101111201010000102121012010 |
4 | 211011133211120100012333 |
5 | 132334304003214434003 |
6 | 1334521301530542303 |
7 | 46232651453546502 |
oct | 4505374530200677 |
9 | 711451100377163 |
10 | 163105231405503 |
11 | 47a745a3a90482 |
12 | 16362a77b97993 |
13 | 70019acac457a |
14 | 2c3c49a19d139 |
15 | 13ccb1c217003 |
hex | 9457e56101bf |
163105231405503 has 16 divisors (see below), whose sum is σ = 217509528657920. Its totient is φ = 108718878975264.
The previous prime is 163105231405453. The next prime is 163105231405513. The reversal of 163105231405503 is 305504132501361.
163105231405503 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 163105231405503 - 232 = 163100936438207 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (163105231405513) 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, 492684450 + ... + 493015392.
It is an arithmetic number, because the mean of its divisors is an integer number (13594345541120).
Almost surely, 2163105231405503 is an apocalyptic number.
163105231405503 is a deficient number, since it is larger than the sum of its proper divisors (54404297252417).
163105231405503 is a wasteful number, since it uses less digits than its factorization.
163105231405503 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 357558.
The product of its (nonzero) digits is 162000, while the sum is 39.
Adding to 163105231405503 its reverse (305504132501361), we get a palindrome (468609363906864).
The spelling of 163105231405503 in words is "one hundred sixty-three trillion, one hundred five billion, two hundred thirty-one million, four hundred five thousand, five hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •