Base | Representation |
---|---|
bin | 11101101000101000001110… |
… | …101010010010111011100111 |
3 | 122002110221020210101201100002 |
4 | 131220220032222102323213 |
5 | 114040403220311024111 |
6 | 1141111115425011515 |
7 | 36311262550542341 |
oct | 3550501652227347 |
9 | 562427223351302 |
10 | 130335323533031 |
11 | 3858a99a332731 |
12 | 1274ba38183b9b |
13 | 5795750654b16 |
14 | 2428398788291 |
15 | 10104c2de463b |
hex | 768a0ea92ee7 |
130335323533031 has 4 divisors (see below), whose sum is σ = 134829645034200. Its totient is φ = 125841002031864.
The previous prime is 130335323532989. The next prime is 130335323533033.
130335323533031 is nontrivially palindromic in base 10.
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 130335323533031 - 222 = 130335319338727 is a prime.
It is a super-2 number, since 2×1303353235330312 (a number of 29 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 (130335323533033) 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, 2247160750541 + ... + 2247160750598.
It is an arithmetic number, because the mean of its divisors is an integer number (33707411258550).
Almost surely, 2130335323533031 is an apocalyptic number.
130335323533031 is a deficient number, since it is larger than the sum of its proper divisors (4494321501169).
130335323533031 is an equidigital number, since it uses as much as digits as its factorization.
130335323533031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4494321501168.
The product of its (nonzero) digits is 328050, while the sum is 38.
The spelling of 130335323533031 in words is "one hundred thirty trillion, three hundred thirty-five billion, three hundred twenty-three million, five hundred thirty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •