Base | Representation |
---|---|
bin | 111110001000000001… |
… | …1110010010010001111 |
3 | 110202100210212122101201 |
4 | 1330100003302102033 |
5 | 4141212313222111 |
6 | 141142252250331 |
7 | 12432052210522 |
oct | 1742003622217 |
9 | 422323778351 |
10 | 133413414031 |
11 | 51642437667 |
12 | 21a33a709a7 |
13 | c772116151 |
14 | 6658968bb9 |
15 | 370c86a6c1 |
hex | 1f100f248f |
133413414031 has 4 divisors (see below), whose sum is σ = 135930648312. Its totient is φ = 130896179752.
The previous prime is 133413414007. The next prime is 133413414041. The reversal of 133413414031 is 130414314331.
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 133413414031 - 29 = 133413413519 is a prime.
It is a super-2 number, since 2×1334134140312 (a number of 23 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 (133413414041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1258617061 + ... + 1258617166.
It is an arithmetic number, because the mean of its divisors is an integer number (33982662078).
Almost surely, 2133413414031 is an apocalyptic number.
133413414031 is a deficient number, since it is larger than the sum of its proper divisors (2517234281).
133413414031 is an equidigital number, since it uses as much as digits as its factorization.
133413414031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2517234280.
The product of its (nonzero) digits is 5184, while the sum is 28.
Adding to 133413414031 its reverse (130414314331), we get a palindrome (263827728362).
The spelling of 133413414031 in words is "one hundred thirty-three billion, four hundred thirteen million, four hundred fourteen thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •