Base | Representation |
---|---|
bin | 11101011101000010100… |
… | …10100110011011011011 |
3 | 10120202012122102111001112 |
4 | 32232201102212123123 |
5 | 113040110432303311 |
6 | 2052530032010535 |
7 | 133054611206630 |
oct | 16564122463333 |
9 | 3522178374045 |
10 | 1012023322331 |
11 | 360218866a1a |
12 | 144178690a4b |
13 | 74583207a58 |
14 | 36da71b6187 |
15 | 1b4d209228b |
hex | eba14a66db |
1012023322331 has 8 divisors (see below), whose sum is σ = 1156624760544. Its totient is φ = 867428553600.
The previous prime is 1012023322273. The next prime is 1012023322333. The reversal of 1012023322331 is 1332233202101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-1012023322331 is a prime.
It is a super-2 number, since 2×10120233223312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1012023322297 and 1012023322306.
It is not an unprimeable number, because it can be changed into a prime (1012023322333) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1337870 + ... + 1952931.
It is an arithmetic number, because the mean of its divisors is an integer number (144578095068).
Almost surely, 21012023322331 is an apocalyptic number.
1012023322331 is a deficient number, since it is larger than the sum of its proper divisors (144601438213).
1012023322331 is an equidigital number, since it uses as much as digits as its factorization.
1012023322331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3334741.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 1012023322331 its reverse (1332233202101), we get a palindrome (2344256524432).
The spelling of 1012023322331 in words is "one trillion, twelve billion, twenty-three million, three hundred twenty-two thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •