Base | Representation |
---|---|
bin | 100100101001100… |
… | …0111101100111101 |
3 | 10011200222201120020 |
4 | 1021103013230331 |
5 | 10004303432203 |
6 | 322005442353 |
7 | 42321460131 |
oct | 11123075475 |
9 | 3150881506 |
10 | 1229749053 |
11 | 581185735 |
12 | 2a3a103b9 |
13 | 167a0c180 |
14 | b94753c1 |
15 | 72e65153 |
hex | 494c7b3d |
1229749053 has 16 divisors (see below), whose sum is σ = 1766768640. Its totient is φ = 756350784.
The previous prime is 1229749051. The next prime is 1229749061. The reversal of 1229749053 is 3509479221.
It is not a de Polignac number, because 1229749053 - 21 = 1229749051 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1229748996 and 1229749014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1229749051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 72388 + ... + 87746.
It is an arithmetic number, because the mean of its divisors is an integer number (110423040).
Almost surely, 21229749053 is an apocalyptic number.
1229749053 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1229749053 is a deficient number, since it is larger than the sum of its proper divisors (537019587).
1229749053 is a wasteful number, since it uses less digits than its factorization.
1229749053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17428.
The product of its (nonzero) digits is 136080, while the sum is 42.
The square root of 1229749053 is about 35067.7779877768. Note that the first 3 decimals coincide. The cubic root of 1229749053 is about 1071.3683988886.
The spelling of 1229749053 in words is "one billion, two hundred twenty-nine million, seven hundred forty-nine thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •