Base | Representation |
---|---|
bin | 111101111100101111… |
… | …0000100111010100001 |
3 | 110201101101202021012022 |
4 | 1323321132010322201 |
5 | 4134423303230423 |
6 | 141040513311225 |
7 | 12416500666244 |
oct | 1737136047241 |
9 | 421341667168 |
10 | 133034430113 |
11 | 51468516412 |
12 | 21948b65515 |
13 | c711752600 |
14 | 66204b525b |
15 | 36d9458dc8 |
hex | 1ef9784ea1 |
133034430113 has 6 divisors (see below), whose sum is σ = 144055033974. Its totient is φ = 122801012256.
The previous prime is 133034430049. The next prime is 133034430169. The reversal of 133034430113 is 311034430331.
It can be written as a sum of positive squares in 3 ways, for example, as 3152036449 + 129882393664 = 56143^2 + 360392^2 .
It is not a de Polignac number, because 133034430113 - 26 = 133034430049 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (133034430173) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 393592820 + ... + 393593157.
It is an arithmetic number, because the mean of its divisors is an integer number (24009172329).
Almost surely, 2133034430113 is an apocalyptic number.
133034430113 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
133034430113 is a deficient number, since it is larger than the sum of its proper divisors (11020603861).
133034430113 is an equidigital number, since it uses as much as digits as its factorization.
133034430113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 787186003 (or 787185990 counting only the distinct ones).
The product of its (nonzero) digits is 3888, while the sum is 26.
Adding to 133034430113 its reverse (311034430331), we get a palindrome (444068860444).
The spelling of 133034430113 in words is "one hundred thirty-three billion, thirty-four million, four hundred thirty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •