Base | Representation |
---|---|
bin | 11101011001011101100… |
… | …01011010110011001011 |
3 | 10120120020202011021112221 |
4 | 32230232301122303023 |
5 | 113022142104140243 |
6 | 2052011235514511 |
7 | 132656161342153 |
oct | 16545661326313 |
9 | 3516222137487 |
10 | 1010102021323 |
11 | 35a42229204a |
12 | 143921158a37 |
13 | 74338156855 |
14 | 36c63d65763 |
15 | 1b41d577bed |
hex | eb2ec5accb |
1010102021323 has 8 divisors (see below), whose sum is σ = 1021794122336. Its totient is φ = 998446176000.
The previous prime is 1010102021311. The next prime is 1010102021351. The reversal of 1010102021323 is 3231202010101.
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 1010102021323 - 237 = 872663067851 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1010102021297 and 1010102021306.
It is not an unprimeable number, because it can be changed into a prime (1010102021023) 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, 9007878 + ... + 9119323.
It is an arithmetic number, because the mean of its divisors is an integer number (127724265292).
Almost surely, 21010102021323 is an apocalyptic number.
1010102021323 is a deficient number, since it is larger than the sum of its proper divisors (11692101013).
1010102021323 is a wasteful number, since it uses less digits than its factorization.
1010102021323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18127845.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 1010102021323 its reverse (3231202010101), we get a palindrome (4241304031424).
The spelling of 1010102021323 in words is "one trillion, ten billion, one hundred two million, twenty-one thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •