Base | Representation |
---|---|
bin | 111101111110101110… |
… | …0000110110000001111 |
3 | 110201120001001111101202 |
4 | 1323331130012300033 |
5 | 4140042330202343 |
6 | 141051252500115 |
7 | 12421240010321 |
oct | 1737534066017 |
9 | 421501044352 |
10 | 133101022223 |
11 | 514a206a014 |
12 | 2196731a63b |
13 | c722499c20 |
14 | 662928b611 |
15 | 36e020edb8 |
hex | 1efd706c0f |
133101022223 has 4 divisors (see below), whose sum is σ = 143339562408. Its totient is φ = 122862482040.
The previous prime is 133101022217. The next prime is 133101022237. The reversal of 133101022223 is 322220101331.
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 133101022223 - 28 = 133101021967 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 133101022195 and 133101022204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133101027223) 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, 5119270073 + ... + 5119270098.
It is an arithmetic number, because the mean of its divisors is an integer number (35834890602).
Almost surely, 2133101022223 is an apocalyptic number.
133101022223 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
133101022223 is a deficient number, since it is larger than the sum of its proper divisors (10238540185).
133101022223 is a wasteful number, since it uses less digits than its factorization.
133101022223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10238540184.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 133101022223 its reverse (322220101331), we get a palindrome (455321123554).
The spelling of 133101022223 in words is "one hundred thirty-three billion, one hundred one million, twenty-two thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •