Base | Representation |
---|---|
bin | 11101011001101001001… |
… | …11101001011111000011 |
3 | 10120120111120202101012122 |
4 | 32230310213221133003 |
5 | 113022342212421311 |
6 | 2052025102314455 |
7 | 132661462240640 |
oct | 16546447513703 |
9 | 3516446671178 |
10 | 1010200123331 |
11 | 35a4726a7593 |
12 | 143949b88a2b |
13 | 74352584489 |
14 | 36c72dc0dc7 |
15 | 1b426ea50db |
hex | eb349e97c3 |
1010200123331 has 8 divisors (see below), whose sum is σ = 1160892960864. Its totient is φ = 861101919360.
The previous prime is 1010200123297. The next prime is 1010200123333. The reversal of 1010200123331 is 1333210020101.
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 1010200123331 - 26 = 1010200123267 is a prime.
It is a super-2 number, since 2×10102001233312 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1010200123333) 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, 398657030 + ... + 398659563.
It is an arithmetic number, because the mean of its divisors is an integer number (145111620108).
Almost surely, 21010200123331 is an apocalyptic number.
1010200123331 is a deficient number, since it is larger than the sum of its proper divisors (150692837533).
1010200123331 is an equidigital number, since it uses as much as digits as its factorization.
1010200123331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 797316781.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 1010200123331 its reverse (1333210020101), we get a palindrome (2343410143432).
The spelling of 1010200123331 in words is "one trillion, ten billion, two hundred million, one hundred twenty-three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •