Base | Representation |
---|---|
bin | 111101111111010010… |
… | …0100010111101000111 |
3 | 110201121100210021121122 |
4 | 1323332210202331013 |
5 | 4140112210341403 |
6 | 141053211504155 |
7 | 12421560301361 |
oct | 1737644427507 |
9 | 421540707548 |
10 | 133120012103 |
11 | 5150185a431 |
12 | 2197175805b |
13 | c7263b8640 |
14 | 662b9d1d31 |
15 | 36e1c11838 |
hex | 1efe922f47 |
133120012103 has 4 divisors (see below), whose sum is σ = 143360013048. Its totient is φ = 122880011160.
The previous prime is 133120012087. The next prime is 133120012139. The reversal of 133120012103 is 301210021331.
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 133120012103 - 24 = 133120012087 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133120012183) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5120000453 + ... + 5120000478.
It is an arithmetic number, because the mean of its divisors is an integer number (35840003262).
Almost surely, 2133120012103 is an apocalyptic number.
133120012103 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
133120012103 is a deficient number, since it is larger than the sum of its proper divisors (10240000945).
133120012103 is a wasteful number, since it uses less digits than its factorization.
133120012103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10240000944.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 133120012103 its reverse (301210021331), we get a palindrome (434330033434).
The spelling of 133120012103 in words is "one hundred thirty-three billion, one hundred twenty million, twelve thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •