Base | Representation |
---|---|
bin | 1001110000000001100… |
… | …00011101010101000101 |
3 | 1012000202010112002012201 |
4 | 10320000300131111011 |
5 | 20442110124332013 |
6 | 413523420314501 |
7 | 33130053210262 |
oct | 4700060352505 |
9 | 1160663462181 |
10 | 335020152133 |
11 | 11a099161997 |
12 | 54b196a2a31 |
13 | 2579128a014 |
14 | 123021b6269 |
15 | 8aabdc03dd |
hex | 4e00c1d545 |
335020152133 has 4 divisors (see below), whose sum is σ = 349586245728. Its totient is φ = 320454058540.
The previous prime is 335020152119. The next prime is 335020152149. The reversal of 335020152133 is 331251020533.
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 not a de Polignac number, because 335020152133 - 233 = 326430217541 is a prime.
It is a super-2 number, since 2×3350201521332 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (335720152133) 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, 7283046763 + ... + 7283046808.
It is an arithmetic number, because the mean of its divisors is an integer number (87396561432).
Almost surely, 2335020152133 is an apocalyptic number.
It is an amenable number.
335020152133 is a deficient number, since it is larger than the sum of its proper divisors (14566093595).
335020152133 is a wasteful number, since it uses less digits than its factorization.
335020152133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14566093594.
The product of its (nonzero) digits is 8100, while the sum is 28.
Adding to 335020152133 its reverse (331251020533), we get a palindrome (666271172666).
The spelling of 335020152133 in words is "three hundred thirty-five billion, twenty million, one hundred fifty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •