Base | Representation |
---|---|
bin | 111100001101101… |
… | …110011011101101 |
3 | 2121101221001102202 |
4 | 330031232123231 |
5 | 4032104343041 |
6 | 244124431245 |
7 | 34014551642 |
oct | 7415563355 |
9 | 2541831382 |
10 | 1010231021 |
11 | 479281578 |
12 | 2423a8525 |
13 | 1313acc47 |
14 | 98251dc9 |
15 | 5da52a9b |
hex | 3c36e6ed |
1010231021 has 8 divisors (see below), whose sum is σ = 1035768384. Its totient is φ = 984736480.
The previous prime is 1010231009. The next prime is 1010231023. The reversal of 1010231021 is 1201320101.
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 1010231021 - 226 = 943122157 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1010230993 and 1010231011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1010231023) 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 7 ways as a sum of consecutive naturals, for example, 40070 + ... + 60216.
It is an arithmetic number, because the mean of its divisors is an integer number (129471048).
Almost surely, 21010231021 is an apocalyptic number.
It is an amenable number.
1010231021 is a deficient number, since it is larger than the sum of its proper divisors (25537363).
1010231021 is a wasteful number, since it uses less digits than its factorization.
1010231021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21411.
The product of its (nonzero) digits is 12, while the sum is 11.
The square root of 1010231021 is about 31784.1315910943. The cubic root of 1010231021 is about 1003.3987755708.
Adding to 1010231021 its reverse (1201320101), we get a palindrome (2211551122).
The spelling of 1010231021 in words is "one billion, ten million, two hundred thirty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •