Base | Representation |
---|---|
bin | 10011011010011011… |
… | …11101110111110001 |
3 | 222220100102022212121 |
4 | 21231031331313301 |
5 | 132321102444213 |
6 | 4442110154241 |
7 | 516163123351 |
oct | 115515756761 |
9 | 28810368777 |
10 | 10422312433 |
11 | 446913a655 |
12 | 202a4b2981 |
13 | ca13418a0 |
14 | 70c294b61 |
15 | 40eecc88d |
hex | 26d37ddf1 |
10422312433 has 16 divisors (see below), whose sum is σ = 11270696976. Its totient is φ = 9580688640.
The previous prime is 10422312431. The next prime is 10422312479. The reversal of 10422312433 is 33421322401.
It can be written as a sum of positive squares in 8 ways, for example, as 6904280464 + 3518031969 = 83092^2 + 59313^2 .
It is a cyclic number.
It is not a de Polignac number, because 10422312433 - 21 = 10422312431 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10422312398 and 10422312407.
It is not an unprimeable number, because it can be changed into a prime (10422312431) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3672291 + ... + 3675127.
It is an arithmetic number, because the mean of its divisors is an integer number (704418561).
Almost surely, 210422312433 is an apocalyptic number.
10422312433 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
10422312433 is a deficient number, since it is larger than the sum of its proper divisors (848384543).
10422312433 is a wasteful number, since it uses less digits than its factorization.
10422312433 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3924.
The product of its (nonzero) digits is 3456, while the sum is 25.
Adding to 10422312433 its reverse (33421322401), we get a palindrome (43843634834).
The spelling of 10422312433 in words is "ten billion, four hundred twenty-two million, three hundred twelve thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •