Base | Representation |
---|---|
bin | 1000001001010100… |
… | …01001000010101001 |
3 | 102021202210200022110 |
4 | 10010222021002221 |
5 | 32424004420431 |
6 | 2001535112533 |
7 | 213240635304 |
oct | 40452110251 |
9 | 12252720273 |
10 | 4373123241 |
11 | 1944572243 |
12 | a20672749 |
13 | 5490127b6 |
14 | 2d6b1db3b |
15 | 1a8dca346 |
hex | 104a890a9 |
4373123241 has 8 divisors (see below), whose sum is σ = 5832887584. Its totient is φ = 2914387200.
The previous prime is 4373123233. The next prime is 4373123269. The reversal of 4373123241 is 1423213734.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 4373123241 - 23 = 4373123233 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4373123199 and 4373123208.
It is not an unprimeable number, because it can be changed into a prime (4373123281) 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, 247096 + ... + 264201.
It is an arithmetic number, because the mean of its divisors is an integer number (729110948).
Almost surely, 24373123241 is an apocalyptic number.
It is an amenable number.
4373123241 is a deficient number, since it is larger than the sum of its proper divisors (1459764343).
4373123241 is a wasteful number, since it uses less digits than its factorization.
4373123241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 514151.
The product of its digits is 12096, while the sum is 30.
The square root of 4373123241 is about 66129.5942903024. The cubic root of 4373123241 is about 1635.2992548593.
Adding to 4373123241 its reverse (1423213734), we get a palindrome (5796336975).
The spelling of 4373123241 in words is "four billion, three hundred seventy-three million, one hundred twenty-three thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •