Base | Representation |
---|---|
bin | 10100111011001110… |
… | …11101011000001101 |
3 | 1001222221022122102000 |
4 | 22131213131120031 |
5 | 141001440121303 |
6 | 5054434022513 |
7 | 545252662314 |
oct | 123547353015 |
9 | 31887278360 |
10 | 11234301453 |
11 | 4845519a61 |
12 | 2216417a39 |
13 | 10a063176b |
14 | 78806127b |
15 | 45b421da3 |
hex | 29d9dd60d |
11234301453 has 16 divisors (see below), whose sum is σ = 17093232960. Its totient is φ = 7287113808.
The previous prime is 11234301443. The next prime is 11234301469. The reversal of 11234301453 is 35410343211.
It is a happy number.
It is not a de Polignac number, because 11234301453 - 218 = 11234039309 is a prime.
It is a super-2 number, since 2×112343014532 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11234301433) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5621775 + ... + 5623772.
It is an arithmetic number, because the mean of its divisors is an integer number (1068327060).
Almost surely, 211234301453 is an apocalyptic number.
It is an amenable number.
11234301453 is a deficient number, since it is larger than the sum of its proper divisors (5858931507).
11234301453 is a wasteful number, since it uses less digits than its factorization.
11234301453 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11245593 (or 11245587 counting only the distinct ones).
The product of its (nonzero) digits is 4320, while the sum is 27.
Adding to 11234301453 its reverse (35410343211), we get a palindrome (46644644664).
The spelling of 11234301453 in words is "eleven billion, two hundred thirty-four million, three hundred one thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •