Base | Representation |
---|---|
bin | 1000100111110111… |
… | …11010110110100001 |
3 | 102221122010000111002 |
4 | 10103323322312201 |
5 | 33440114120303 |
6 | 2043213001345 |
7 | 222502415213 |
oct | 42373726641 |
9 | 12848100432 |
10 | 4629441953 |
11 | 1a66221294 |
12 | a92483255 |
13 | 58a158286 |
14 | 31cba25b3 |
15 | 1c165b788 |
hex | 113efada1 |
4629441953 has 4 divisors (see below), whose sum is σ = 4629713088. Its totient is φ = 4629170820.
The previous prime is 4629441923. The next prime is 4629441977. The reversal of 4629441953 is 3591449264.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 4629441953 - 28 = 4629441697 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4629441898 and 4629441907.
It is not an unprimeable number, because it can be changed into a prime (4629441923) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 108101 + ... + 144722.
It is an arithmetic number, because the mean of its divisors is an integer number (1157428272).
Almost surely, 24629441953 is an apocalyptic number.
It is an amenable number.
4629441953 is a deficient number, since it is larger than the sum of its proper divisors (271135).
4629441953 is a wasteful number, since it uses less digits than its factorization.
4629441953 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 271134.
The product of its digits is 933120, while the sum is 47.
The square root of 4629441953 is about 68040.0025940623. The cubic root of 4629441953 is about 1666.6441451668.
The spelling of 4629441953 in words is "four billion, six hundred twenty-nine million, four hundred forty-one thousand, nine hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •