Base | Representation |
---|---|
bin | 11101011001010010101… |
… | …11100000010111111011 |
3 | 10120120000102112022100202 |
4 | 32230221113200113323 |
5 | 113022000400423311 |
6 | 2051554240152415 |
7 | 132654010521005 |
oct | 16545127402773 |
9 | 3516012468322 |
10 | 1010011342331 |
11 | 35a386087632 |
12 | 1438b690870b |
13 | 74322427844 |
14 | 36c55cbd375 |
15 | 1b415614e3b |
hex | eb295e05fb |
1010011342331 has 4 divisors (see below), whose sum is σ = 1011658996032. Its totient is φ = 1008363688632.
The previous prime is 1010011342279. The next prime is 1010011342399. The reversal of 1010011342331 is 1332431100101.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1010011342331 - 210 = 1010011341307 is a prime.
It is a super-2 number, since 2×10100113423312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1010011342531) 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 3 ways as a sum of consecutive naturals, for example, 823825931 + ... + 823827156.
It is an arithmetic number, because the mean of its divisors is an integer number (252914749008).
Almost surely, 21010011342331 is an apocalyptic number.
1010011342331 is a deficient number, since it is larger than the sum of its proper divisors (1647653701).
1010011342331 is an equidigital number, since it uses as much as digits as its factorization.
1010011342331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1647653700.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 1010011342331 its reverse (1332431100101), we get a palindrome (2342442442432).
The spelling of 1010011342331 in words is "one trillion, ten billion, eleven million, three hundred forty-two thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •