Base | Representation |
---|---|
bin | 1010010001110111111110… |
… | …1011010011001111110001 |
3 | 1111000110221211011202121011 |
4 | 2210131333223103033301 |
5 | 2440133401424410413 |
6 | 40012054240030521 |
7 | 2244362035335124 |
oct | 244357753231761 |
9 | 44013854152534 |
10 | 11302201013233 |
11 | 3668266908009 |
12 | 1326538302441 |
13 | 63ca4024a550 |
14 | 2b105ab3a3bb |
15 | 148ee21d533d |
hex | a477fad33f1 |
11302201013233 has 16 divisors (see below), whose sum is σ = 12813708559680. Its totient is φ = 9882551409984.
The previous prime is 11302201013231. The next prime is 11302201013237. The reversal of 11302201013233 is 33231010220311.
It is not a de Polignac number, because 11302201013233 - 21 = 11302201013231 is a prime.
It is a super-2 number, since 2×113022010132332 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11302201013231) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 551191 + ... + 4786252.
It is an arithmetic number, because the mean of its divisors is an integer number (800856784980).
Almost surely, 211302201013233 is an apocalyptic number.
11302201013233 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
11302201013233 is a deficient number, since it is larger than the sum of its proper divisors (1511507546447).
11302201013233 is a wasteful number, since it uses less digits than its factorization.
11302201013233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5346048.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 11302201013233 its reverse (33231010220311), we get a palindrome (44533211233544).
The spelling of 11302201013233 in words is "eleven trillion, three hundred two billion, two hundred one million, thirteen thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •