Base | Representation |
---|---|
bin | 111110000110001001… |
… | …0010011011100101111 |
3 | 110202012101202111222212 |
4 | 1330030102103130233 |
5 | 4141100112023043 |
6 | 141132111401035 |
7 | 12430353145613 |
oct | 1741422233457 |
9 | 422171674885 |
10 | 133350111023 |
11 | 5160a730128 |
12 | 21a1682317b |
13 | c761c8094c |
14 | 66503ab343 |
15 | 3707014018 |
hex | 1f0c49372f |
133350111023 has 8 divisors (see below), whose sum is σ = 133583128992. Its totient is φ = 133117200736.
The previous prime is 133350111019. The next prime is 133350111101. The reversal of 133350111023 is 320111053331.
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 133350111023 - 22 = 133350111019 is a prime.
It is a super-2 number, since 2×1333501110232 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 133350111023.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133350111523) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2688161 + ... + 2737317.
It is an arithmetic number, because the mean of its divisors is an integer number (16697891124).
Almost surely, 2133350111023 is an apocalyptic number.
133350111023 is a deficient number, since it is larger than the sum of its proper divisors (233017969).
133350111023 is an equidigital number, since it uses as much as digits as its factorization.
133350111023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 53841.
The product of its (nonzero) digits is 810, while the sum is 23.
Adding to 133350111023 its reverse (320111053331), we get a palindrome (453461164354).
The spelling of 133350111023 in words is "one hundred thirty-three billion, three hundred fifty million, one hundred eleven thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.126 sec. • engine limits •