Base | Representation |
---|---|
bin | 111100001100111… |
… | …001000010100001 |
3 | 2121101111221102202 |
4 | 330030321002201 |
5 | 4032030343241 |
6 | 244120022545 |
7 | 34012651223 |
oct | 7414710241 |
9 | 2541457382 |
10 | 1010012321 |
11 | 47914222a |
12 | 242301a55 |
13 | 131334536 |
14 | 981d6413 |
15 | 5da0cd9b |
hex | 3c3390a1 |
1010012321 has 4 divisors (see below), whose sum is σ = 1010252100. Its totient is φ = 1009772544.
The previous prime is 1010012299. The next prime is 1010012329. The reversal of 1010012321 is 1232100101.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 480091921 + 529920400 = 21911^2 + 23020^2 .
It is a cyclic number.
It is not a de Polignac number, because 1010012321 - 26 = 1010012257 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1010012329) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 113456 + ... + 122033.
It is an arithmetic number, because the mean of its divisors is an integer number (252563025).
Almost surely, 21010012321 is an apocalyptic number.
It is an amenable number.
1010012321 is a deficient number, since it is larger than the sum of its proper divisors (239779).
1010012321 is an equidigital number, since it uses as much as digits as its factorization.
1010012321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 239778.
The product of its (nonzero) digits is 12, while the sum is 11.
The square root of 1010012321 is about 31780.6910088500. The cubic root of 1010012321 is about 1003.3263633717.
Adding to 1010012321 its reverse (1232100101), we get a palindrome (2242112422).
The spelling of 1010012321 in words is "one billion, ten million, twelve thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.141 sec. • engine limits •