Base | Representation |
---|---|
bin | 100101000100100111110010… |
… | …101011111100110100010111 |
3 | 210101021222111001012112200202 |
4 | 211010213302223330310113 |
5 | 132332313311213143111 |
6 | 1334433553251331115 |
7 | 46225431102612200 |
oct | 4504476253746427 |
9 | 711258431175622 |
10 | 163045325131031 |
11 | 47a511524a9832 |
12 | 163533395b0a9b |
13 | 6cc91538c1c95 |
14 | 2c39615d465a7 |
15 | 13cb2b2d29b3b |
hex | 9449f2afcd17 |
163045325131031 has 12 divisors (see below), whose sum is σ = 193700394947808. Its totient is φ = 136779664849632.
The previous prime is 163045325131009. The next prime is 163045325131033. The reversal of 163045325131031 is 130131523540361.
It is not a de Polignac number, because 163045325131031 - 214 = 163045325114647 is a prime.
It is a super-2 number, since 2×1630453251310312 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (163045325131033) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 35398461686 + ... + 35398466291.
It is an arithmetic number, because the mean of its divisors is an integer number (16141699578984).
Almost surely, 2163045325131031 is an apocalyptic number.
163045325131031 is a deficient number, since it is larger than the sum of its proper divisors (30655069816777).
163045325131031 is an equidigital number, since it uses as much as digits as its factorization.
163045325131031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 70796928038 (or 70796928031 counting only the distinct ones).
The product of its (nonzero) digits is 97200, while the sum is 38.
Adding to 163045325131031 its reverse (130131523540361), we get a palindrome (293176848671392).
The spelling of 163045325131031 in words is "one hundred sixty-three trillion, forty-five billion, three hundred twenty-five million, one hundred thirty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •