Base | Representation |
---|---|
bin | 1001011111010101110011… |
… | …1010001101001010100101 |
3 | 1100221111001210101102111122 |
4 | 2113311130322031022211 |
5 | 2331422400241333013 |
6 | 34105155034543325 |
7 | 2124556045256150 |
oct | 227653472151245 |
9 | 40844053342448 |
10 | 10434034324133 |
11 | 336305a3a7922 |
12 | 1206228b97b45 |
13 | 5a8c0490a5a4 |
14 | 28101d466c97 |
15 | 13162e71aa08 |
hex | 97d5ce8d2a5 |
10434034324133 has 48 divisors (see below), whose sum is σ = 12692541196800. Its totient is φ = 8400632276736.
The previous prime is 10434034324127. The next prime is 10434034324151. The reversal of 10434034324133 is 33142343043401.
It is not a de Polignac number, because 10434034324133 - 24 = 10434034324117 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 10434034324093 and 10434034324102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10434034324163) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 3117427166 + ... + 3117430512.
It is an arithmetic number, because the mean of its divisors is an integer number (264427941600).
Almost surely, 210434034324133 is an apocalyptic number.
It is an amenable number.
10434034324133 is a deficient number, since it is larger than the sum of its proper divisors (2258506872667).
10434034324133 is a wasteful number, since it uses less digits than its factorization.
10434034324133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5994 (or 5977 counting only the distinct ones).
The product of its (nonzero) digits is 124416, while the sum is 35.
Adding to 10434034324133 its reverse (33142343043401), we get a palindrome (43576377367534).
The spelling of 10434034324133 in words is "ten trillion, four hundred thirty-four billion, thirty-four million, three hundred twenty-four thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •