Base | Representation |
---|---|
bin | 100100011110110… |
… | …0100101001000111 |
3 | 10011022100202002201 |
4 | 1020331210221013 |
5 | 10001332203143 |
6 | 321244415331 |
7 | 42222452620 |
oct | 11075445107 |
9 | 3138322081 |
10 | 1224100423 |
11 | 578a77847 |
12 | 2a1b47547 |
13 | 1667b20a0 |
14 | b8804a47 |
15 | 726eb64d |
hex | 48f64a47 |
1224100423 has 8 divisors (see below), whose sum is σ = 1506585248. Its totient is φ = 968518944.
The previous prime is 1224100391. The next prime is 1224100429. The reversal of 1224100423 is 3240014221.
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 1224100423 - 25 = 1224100391 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1224100423.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1224100429) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6725736 + ... + 6725917.
It is an arithmetic number, because the mean of its divisors is an integer number (188323156).
Almost surely, 21224100423 is an apocalyptic number.
1224100423 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
1224100423 is a deficient number, since it is larger than the sum of its proper divisors (282484825).
1224100423 is a wasteful number, since it uses less digits than its factorization.
1224100423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13451673.
The product of its (nonzero) digits is 384, while the sum is 19.
The square root of 1224100423 is about 34987.1465398366. The cubic root of 1224100423 is about 1069.7255018341.
Adding to 1224100423 its reverse (3240014221), we get a palindrome (4464114644).
The spelling of 1224100423 in words is "one billion, two hundred twenty-four million, one hundred thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •