Base | Representation |
---|---|
bin | 1001101100010100011… |
… | …00111100001110011101 |
3 | 1011211121111211021210210 |
4 | 10312022030330032131 |
5 | 20424021432130023 |
6 | 412554204523033 |
7 | 33026551620051 |
oct | 4661214741635 |
9 | 1154544737723 |
10 | 333031130013 |
11 | 11926843315a |
12 | 54663550479 |
13 | 2553518765a |
14 | 12193d77c61 |
15 | 89e247a593 |
hex | 4d8a33c39d |
333031130013 has 4 divisors (see below), whose sum is σ = 444041506688. Its totient is φ = 222020753340.
The previous prime is 333031129979. The next prime is 333031130023. The reversal of 333031130013 is 310031130333.
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 not a de Polignac number, because 333031130013 - 213 = 333031121821 is a prime.
It is a super-2 number, since 2×3330311300132 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (333031130023) 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, 55505188333 + ... + 55505188338.
It is an arithmetic number, because the mean of its divisors is an integer number (111010376672).
Almost surely, 2333031130013 is an apocalyptic number.
It is an amenable number.
333031130013 is a deficient number, since it is larger than the sum of its proper divisors (111010376675).
333031130013 is a wasteful number, since it uses less digits than its factorization.
333031130013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 111010376674.
The product of its (nonzero) digits is 729, while the sum is 21.
Adding to 333031130013 its reverse (310031130333), we get a palindrome (643062260346).
The spelling of 333031130013 in words is "three hundred thirty-three billion, thirty-one million, one hundred thirty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.164 sec. • engine limits •