Base | Representation |
---|---|
bin | 1010011000111011000111… |
… | …0011001101110101110101 |
3 | 1111110001112111020011222210 |
4 | 2212032301303031311311 |
5 | 2444124410031031313 |
6 | 40143443025444033 |
7 | 2256210022456200 |
oct | 246166163156565 |
9 | 44401474204883 |
10 | 11423301033333 |
11 | 370465a6a0552 |
12 | 1345ab44a0619 |
13 | 64b29c2c1787 |
14 | 2b6c681c8937 |
15 | 14c22da279c3 |
hex | a63b1ccdd75 |
11423301033333 has 48 divisors (see below), whose sum is σ = 18089763540480. Its totient is φ = 6391065792384.
The previous prime is 11423301033271. The next prime is 11423301033359. The reversal of 11423301033333 is 33333010332411.
It is a happy number.
It is not a de Polignac number, because 11423301033333 - 26 = 11423301033269 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11423301033333.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11423301033373) 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, 2201391 + ... + 5262387.
It is an arithmetic number, because the mean of its divisors is an integer number (376870073760).
Almost surely, 211423301033333 is an apocalyptic number.
It is an amenable number.
11423301033333 is a deficient number, since it is larger than the sum of its proper divisors (6666462507147).
11423301033333 is a wasteful number, since it uses less digits than its factorization.
11423301033333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3061546 (or 3061539 counting only the distinct ones).
The product of its (nonzero) digits is 17496, while the sum is 30.
Adding to 11423301033333 its reverse (33333010332411), we get a palindrome (44756311365744).
The spelling of 11423301033333 in words is "eleven trillion, four hundred twenty-three billion, three hundred one million, thirty-three thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •