Base | Representation |
---|---|
bin | 100101000100100010110101… |
… | …010111111010100000011011 |
3 | 210101021110202000212010110221 |
4 | 211010202311113322200123 |
5 | 132332221410341014321 |
6 | 1334431313115420511 |
7 | 46225152140530432 |
oct | 4504426527724033 |
9 | 711243660763427 |
10 | 163040001501211 |
11 | 47a4997044896a |
12 | 163522b2754737 |
13 | 6cc87b59b0c73 |
14 | 2c3926ccc0119 |
15 | 13cb0a0797e41 |
hex | 9448b55fa81b |
163040001501211 has 8 divisors (see below), whose sum is σ = 163187952003360. Its totient is φ = 162892052686272.
The previous prime is 163040001501197. The next prime is 163040001501233. The reversal of 163040001501211 is 112105100040361.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 163040001501211 - 29 = 163040001500699 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (163040001501911) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 273395586 + ... + 273991288.
It is an arithmetic number, because the mean of its divisors is an integer number (20398494000420).
Almost surely, 2163040001501211 is an apocalyptic number.
163040001501211 is a deficient number, since it is larger than the sum of its proper divisors (147950502149).
163040001501211 is a wasteful number, since it uses less digits than its factorization.
163040001501211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 843605.
The product of its (nonzero) digits is 720, while the sum is 25.
Adding to 163040001501211 its reverse (112105100040361), we get a palindrome (275145101541572).
The spelling of 163040001501211 in words is "one hundred sixty-three trillion, forty billion, one million, five hundred one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •