Base | Representation |
---|---|
bin | 111101011101010110010… |
… | …001111111110101000001 |
3 | 112221202100000222101212110 |
4 | 331131112101333311001 |
5 | 1023144011001113213 |
6 | 12552111532045533 |
7 | 614062541111061 |
oct | 75352621776501 |
9 | 15852300871773 |
10 | 4223400410433 |
11 | 1389152478546 |
12 | 5826343038a9 |
13 | 24835a1300c9 |
14 | 1085b117d3a1 |
15 | 74cd89845c3 |
hex | 3d75647fd41 |
4223400410433 has 32 divisors (see below), whose sum is σ = 5756662904832. Its totient is φ = 2753593113600.
The previous prime is 4223400410429. The next prime is 4223400410507. The reversal of 4223400410433 is 3340140043224.
It is a happy number.
It is not a de Polignac number, because 4223400410433 - 22 = 4223400410429 is a prime.
It is a super-2 number, since 2×42234004104332 (a number of 26 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 4223400410433.
It is not an unprimeable number, because it can be changed into a prime (4223400410833) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 14116788 + ... + 14412858.
It is an arithmetic number, because the mean of its divisors is an integer number (179895715776).
Almost surely, 24223400410433 is an apocalyptic number.
It is an amenable number.
4223400410433 is a deficient number, since it is larger than the sum of its proper divisors (1533262494399).
4223400410433 is a wasteful number, since it uses less digits than its factorization.
4223400410433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 296685.
The product of its (nonzero) digits is 27648, while the sum is 30.
Adding to 4223400410433 its reverse (3340140043224), we get a palindrome (7563540453657).
The spelling of 4223400410433 in words is "four trillion, two hundred twenty-three billion, four hundred million, four hundred ten thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •