Base | Representation |
---|---|
bin | 100000110000010… |
… | …0000101111000011 |
3 | 2211121001002211022 |
4 | 1001200200233003 |
5 | 4222323313411 |
6 | 301020140055 |
7 | 36143462204 |
oct | 10140405703 |
9 | 2747032738 |
10 | 1099041731 |
11 | 514420357 |
12 | 26809762b |
13 | 146906768 |
14 | a5d6d5ab |
15 | 66746edb |
hex | 41820bc3 |
1099041731 has 8 divisors (see below), whose sum is σ = 1122012000. Its totient is φ = 1076279680.
The previous prime is 1099041709. The next prime is 1099041743. The reversal of 1099041731 is 1371409901.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1099041731 - 210 = 1099040707 is a prime.
It is a super-2 number, since 2×10990417312 = 2415785452958952722, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1099041691 and 1099041700.
It is not an unprimeable number, because it can be changed into a prime (1099041631) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 41366 + ... + 62523.
It is an arithmetic number, because the mean of its divisors is an integer number (140251500).
Almost surely, 21099041731 is an apocalyptic number.
1099041731 is a deficient number, since it is larger than the sum of its proper divisors (22970269).
1099041731 is a wasteful number, since it uses less digits than its factorization.
1099041731 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 104109.
The product of its (nonzero) digits is 6804, while the sum is 35.
The square root of 1099041731 is about 33151.7983071809. The cubic root of 1099041731 is about 1031.9802701770.
The spelling of 1099041731 in words is "one billion, ninety-nine million, forty-one thousand, seven hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •