Base | Representation |
---|---|
bin | 11101000110101001011… |
… | …01111101110110111001 |
3 | 10112121011210202000220021 |
4 | 32203110231331312321 |
5 | 112341000303413223 |
6 | 2043221052530441 |
7 | 132150651140536 |
oct | 16432455756671 |
9 | 3477153660807 |
10 | 1000001232313 |
11 | 356109697836 |
12 | 141982480a21 |
13 | 733b860a715 |
14 | 36586687d8d |
15 | 1b02b90b65d |
hex | e8d4b7ddb9 |
1000001232313 has 4 divisors (see below), whose sum is σ = 1012659475840. Its totient is φ = 987342988788.
The previous prime is 1000001232301. The next prime is 1000001232331. The reversal of 1000001232313 is 3132321000001.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1000001232313 is a prime.
It is a super-4 number, since 4×10000012323134 (a number of 49 digits) contains 4444 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1000001232343) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6329121645 + ... + 6329121802.
It is an arithmetic number, because the mean of its divisors is an integer number (253164868960).
Almost surely, 21000001232313 is an apocalyptic number.
It is an amenable number.
1000001232313 is a deficient number, since it is larger than the sum of its proper divisors (12658243527).
1000001232313 is an equidigital number, since it uses as much as digits as its factorization.
1000001232313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12658243526.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 1000001232313 its reverse (3132321000001), we get a palindrome (4132322232314).
The spelling of 1000001232313 in words is "one trillion, one million, two hundred thirty-two thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •