Base | Representation |
---|---|
bin | 111101000110010111… |
… | …1010011100100010001 |
3 | 110112200021012022010101 |
4 | 1322030233103210101 |
5 | 4122204304330113 |
6 | 140135510332401 |
7 | 12323340360541 |
oct | 1721457234421 |
9 | 415607168111 |
10 | 131210230033 |
11 | 50711832943 |
12 | 2151a05a101 |
13 | c4b083b48c |
14 | 64ca0dd321 |
15 | 362e2202dd |
hex | 1e8cbd3911 |
131210230033 has 8 divisors (see below), whose sum is σ = 134731285920. Its totient is φ = 127704450720.
The previous prime is 131210230027. The next prime is 131210230037. The reversal of 131210230033 is 330032012131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 131210230033 - 225 = 131176675601 is a prime.
It is a super-2 number, since 2×1312102300332 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (131210230037) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3801735 + ... + 3836092.
It is an arithmetic number, because the mean of its divisors is an integer number (16841410740).
Almost surely, 2131210230033 is an apocalyptic number.
It is an amenable number.
131210230033 is a deficient number, since it is larger than the sum of its proper divisors (3521055887).
131210230033 is an equidigital number, since it uses as much as digits as its factorization.
131210230033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7638287.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 131210230033 its reverse (330032012131), we get a palindrome (461242242164).
The spelling of 131210230033 in words is "one hundred thirty-one billion, two hundred ten million, two hundred thirty thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •