Base | Representation |
---|---|
bin | 110000000001100110… |
… | …1111011111101101001 |
3 | 100212012112022101221210 |
4 | 1200003031323331221 |
5 | 3142204044401413 |
6 | 115213450223333 |
7 | 10310510511030 |
oct | 1400315737551 |
9 | 325175271853 |
10 | 103133200233 |
11 | 3a814003888 |
12 | 17ba3124b49 |
13 | 995799028b |
14 | 4dc521b717 |
15 | 2a393403c3 |
hex | 180337bf69 |
103133200233 has 8 divisors (see below), whose sum is σ = 157155352768. Its totient is φ = 58933257264.
The previous prime is 103133200217. The next prime is 103133200253. The reversal of 103133200233 is 332002331301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 103133200233 - 24 = 103133200217 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21), and also a Moran number because the ratio is a prime number: 4911104773 = 103133200233 / (1 + 0 + 3 + 1 + 3 + 3 + 2 + 0 + 0 + 2 + 3 + 3).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (103133200253) 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, 2455552366 + ... + 2455552407.
It is an arithmetic number, because the mean of its divisors is an integer number (19644419096).
Almost surely, 2103133200233 is an apocalyptic number.
It is an amenable number.
103133200233 is a deficient number, since it is larger than the sum of its proper divisors (54022152535).
103133200233 is an equidigital number, since it uses as much as digits as its factorization.
103133200233 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4911104783.
The product of its (nonzero) digits is 972, while the sum is 21.
Adding to 103133200233 its reverse (332002331301), we get a palindrome (435135531534).
The spelling of 103133200233 in words is "one hundred three billion, one hundred thirty-three million, two hundred thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •