Base | Representation |
---|---|
bin | 11110011100101111111… |
… | …00010001110000001111 |
3 | 10201000111022012101210110 |
4 | 33032113330101300033 |
5 | 114120132402321103 |
6 | 2120344002411103 |
7 | 135405314041653 |
oct | 17162774216017 |
9 | 3630438171713 |
10 | 1046226213903 |
11 | 37377a471662 |
12 | 14a923060a93 |
13 | 7787424ba30 |
14 | 388cd8aaa63 |
15 | 1c334b6c403 |
hex | f397f11c0f |
1046226213903 has 32 divisors (see below), whose sum is σ = 1505639951872. Its totient is φ = 642390134400.
The previous prime is 1046226213863. The next prime is 1046226213919. The reversal of 1046226213903 is 3093126226401.
It is a Cunningham number, because it is equal to 10228522-1.
It is not a de Polignac number, because 1046226213903 - 217 = 1046226082831 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1046226213503) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 39878076 + ... + 39904302.
It is an arithmetic number, because the mean of its divisors is an integer number (47051248496).
Almost surely, 21046226213903 is an apocalyptic number.
1046226213903 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
1046226213903 is a deficient number, since it is larger than the sum of its proper divisors (459413737969).
1046226213903 is a wasteful number, since it uses less digits than its factorization.
1046226213903 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28495.
The product of its (nonzero) digits is 93312, while the sum is 39.
The spelling of 1046226213903 in words is "one trillion, forty-six billion, two hundred twenty-six million, two hundred thirteen thousand, nine hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •