Base | Representation |
---|---|
bin | 100101001010101100000110… |
… | …001100010100111000001001 |
3 | 210102202211200020122102202212 |
4 | 211022230012030110320021 |
5 | 132411131204114304001 |
6 | 1335353305535034505 |
7 | 46300521201414635 |
oct | 4512540614247011 |
9 | 712684606572685 |
10 | 163462264213001 |
11 | 480a1a58772126 |
12 | 164000b966ba35 |
13 | 702956b714940 |
14 | 2c51889a8bdc5 |
15 | 13d70668b57bb |
hex | 94ab06314e09 |
163462264213001 has 16 divisors (see below), whose sum is σ = 176196434748096. Its totient is φ = 150750977484096.
The previous prime is 163462264212983. The next prime is 163462264213049. The reversal of 163462264213001 is 100312462264361.
It is a cyclic number.
It is not a de Polignac number, because 163462264213001 - 246 = 93093520035337 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 163462264213001.
It is not an unprimeable number, because it can be changed into a prime (163462264213201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1268924471 + ... + 1269053283.
It is an arithmetic number, because the mean of its divisors is an integer number (11012277171756).
Almost surely, 2163462264213001 is an apocalyptic number.
It is an amenable number.
163462264213001 is a deficient number, since it is larger than the sum of its proper divisors (12734170535095).
163462264213001 is a wasteful number, since it uses less digits than its factorization.
163462264213001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 216872.
The product of its (nonzero) digits is 248832, while the sum is 41.
The spelling of 163462264213001 in words is "one hundred sixty-three trillion, four hundred sixty-two billion, two hundred sixty-four million, two hundred thirteen thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •