Base | Representation |
---|---|
bin | 101111000010000110… |
… | …0000011111110010001 |
3 | 100122201000002100000210 |
4 | 1132010030003332101 |
5 | 3123323003033241 |
6 | 114222155234333 |
7 | 10203631566033 |
oct | 1360414037621 |
9 | 318630070023 |
10 | 101002002321 |
11 | 3991aaa72a0 |
12 | 176a94489a9 |
13 | 96a829b11c |
14 | 4c6216dc53 |
15 | 29621b4316 |
hex | 1784303f91 |
101002002321 has 48 divisors (see below), whose sum is σ = 157619831040. Its totient is φ = 56896407360.
The previous prime is 101002002307. The next prime is 101002002371. The reversal of 101002002321 is 123200200101.
It is not a de Polignac number, because 101002002321 - 219 = 101001478033 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101002002297 and 101002002306.
It is not an unprimeable number, because it can be changed into a prime (101002002371) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1732570 + ... + 1789916.
It is an arithmetic number, because the mean of its divisors is an integer number (3283746480).
Almost surely, 2101002002321 is an apocalyptic number.
101002002321 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
101002002321 is a deficient number, since it is larger than the sum of its proper divisors (56617828719).
101002002321 is a wasteful number, since it uses less digits than its factorization.
101002002321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57486 (or 57433 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 12.
Adding to 101002002321 its reverse (123200200101), we get a palindrome (224202202422).
The spelling of 101002002321 in words is "one hundred one billion, two million, two thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •