Base | Representation |
---|---|
bin | 10101010101000101… |
… | …01011111001110001 |
3 | 1002120001100220020001 |
4 | 22222202223321301 |
5 | 141422443412113 |
6 | 5132141550001 |
7 | 553525126504 |
oct | 125242537161 |
9 | 32501326201 |
10 | 11451154033 |
11 | 4946972570 |
12 | 2276b75301 |
13 | 11065396b7 |
14 | 7a8b8d13b |
15 | 4704a97dd |
hex | 2aa8abe71 |
11451154033 has 4 divisors (see below), whose sum is σ = 12492168048. Its totient is φ = 10410140020.
The previous prime is 11451154027. The next prime is 11451154069. The reversal of 11451154033 is 33045115411.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 11451154033 - 213 = 11451145841 is a prime.
It is a super-2 number, since 2×114511540332 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11451153992 and 11451154010.
It is not an unprimeable number, because it can be changed into a prime (11451154333) 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, 520506991 + ... + 520507012.
It is an arithmetic number, because the mean of its divisors is an integer number (3123042012).
Almost surely, 211451154033 is an apocalyptic number.
It is an amenable number.
11451154033 is a deficient number, since it is larger than the sum of its proper divisors (1041014015).
11451154033 is a wasteful number, since it uses less digits than its factorization.
11451154033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1041014014.
The product of its (nonzero) digits is 3600, while the sum is 28.
Adding to 11451154033 its reverse (33045115411), we get a palindrome (44496269444).
The spelling of 11451154033 in words is "eleven billion, four hundred fifty-one million, one hundred fifty-four thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •