Base | Representation |
---|---|
bin | 10110111110001101100100… |
… | …011101110001011111110001 |
3 | 111020201120202211000221110210 |
4 | 112332031210131301133301 |
5 | 101220302422003332241 |
6 | 554513315201214333 |
7 | 30165223062632244 |
oct | 2676154435613761 |
9 | 436646684027423 |
10 | 101032201230321 |
11 | 2a212574766009 |
12 | b3b88739313a9 |
13 | 444b3ac84920a |
14 | 1ad3dadb8125b |
15 | ba312d021316 |
hex | 5be3647717f1 |
101032201230321 has 4 divisors (see below), whose sum is σ = 134709601640432. Its totient is φ = 67354800820212.
The previous prime is 101032201230299. The next prime is 101032201230329. The reversal of 101032201230321 is 123032102230101.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 101032201230321 - 213 = 101032201222129 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101032201230329) 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, 16838700205051 + ... + 16838700205056.
It is an arithmetic number, because the mean of its divisors is an integer number (33677400410108).
Almost surely, 2101032201230321 is an apocalyptic number.
It is an amenable number.
101032201230321 is a deficient number, since it is larger than the sum of its proper divisors (33677400410111).
101032201230321 is an equidigital number, since it uses as much as digits as its factorization.
101032201230321 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 33677400410110.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 101032201230321 its reverse (123032102230101), we get a palindrome (224064303460422).
The spelling of 101032201230321 in words is "one hundred one trillion, thirty-two billion, two hundred one million, two hundred thirty thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •